Fast algorithms and lower bounds for problems in infinite-state systems
The EU-funded INFSYS project aims to find solutions to challenging problems related to computational models called infinite-state systems. The project objectives concentrate on three main problems. The first one is reachability in Petri nets and vector addition systems. The study could lead to the design of faster algorithms that for a given system, defining the initial situation and the set of moves available, would answer the question about the possibility of transition to a specific end situation. The other two problems INFSYS will address are separation in automata theory and unambiguity in simple models.
Funding SchemeERC-STG - Starting Grant
00 927 Warszawa
See on map