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...
| Main Authors: | , , |
|---|---|
| Formato: | Conference item |
| Idioma: | English |
| Publicado: |
Springer
2021
|
Títulos similares
Reachability in Succinct and Parametric One−Counter Automata
por: Haase, C, et al.
Publicado: (2009)
por: Haase, C, et al.
Publicado: (2009)