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...

Description complète

Détails bibliographiques
Auteurs principaux: Blondin, M, Haase, CJ, Offtermatt, P
Format: Conference item
Langue:English
Publié: Springer 2021

Documents similaires