Directed reachability for infinite-state systems

Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary time, which raises questions about the practical applicabili...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Blondin, M, Haase, CJ, Offtermatt, P
Fformat: Conference item
Iaith:English
Cyhoeddwyd: Springer 2021

Eitemau Tebyg