Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

INFSYS

Financiado

Cerrado

Challenging Problems in Infinite State Systems

Investigation of infinite state systems is an active field since the early days of computer science. Despite of decades of research the most fundamental questions are not understood well even for basic models using only counters o... ver más

28/02/2026

UNIWARSAW

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

UNIWERSYTET WARSZAWSKI No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2020-09-11

ERC-2020-STG: ERC STARTING GRANTS

I+D

Cerrada hace 5 años

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

2 Participantes

UNIWARSAW

1.34M€ | Lider

ALFREDO IÑESTA

118.80K€ | Participante

Proyectos interesantes

TIN2010-20967-C04-01

Software

Data Science

37K€ Cerrado

LASD

Software

Data Science

2M€ Cerrado

AVS-ISS

Software

Data Science

2M€ Cerrado

LIPA

Software

Data Science

2M€ Cerrado

PARAPATH

Software

Data Science

1M€ Cerrado

PID2019-108991GB-I00

Software

Data Science

76K€ Cerrado

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Duración del proyecto: 65 meses Fecha Inicio: 2020-09-11
Fecha Fin: 2026-02-28

Líder del proyecto

UNIWERSYTET WARSZAWSKI No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Investigation of infinite state systems is an active field since the early days of computer science. Despite of decades of research the most fundamental questions are not understood well even for basic models using only counters or a stack. The aim of the project is to provide solutions of the most challenging problems in the area. The goals of the project are grouped in three tasks: - The first goal in concerned with the reachability problem in Petri nets or Vector Addition Systems (VASes), a classical problem of fundamental importance. Recently, in a breakthrough paper (awarded the Best Paper Award at STOC 2019) with co-authors we have improved the lower bound for this problem from \expspace to \tower-hardness. The main goal of this task is to establish exact complexity of the reachability problem. - The second task focuses on separability problems, which ask about existence of simple classifiers. The first main goal in this task is to prove decidability of an important problem of regular separability for languages of VASes, i.e. the question whether for two given VAS languages there is a regular language including one of them and disjoint from the other one. Second main goal is to solve the word separating problem, namely to decide whether for each two words of length $n$ there exists a DFA with logarithmic number of states recognizing exactly one of them. - Without doubt the role of nondeterminism is a key question in theoretical computer science. The goal of this task is to study the related notion of unambiguity, which has very interesting properties, but is much less understood. My plan is to study unambiguity in simple models. The main goal here is to understand the complexity of the universality problem of unambiguous variants of finite automata and their extensions.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores