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...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Conference item |
| Språk: | English |
| Publicerad: |
Springer
2021
|
Liknande verk
Reachability in Succinct and Parametric One−Counter Automata
av: Haase, C, et al.
Publicerad: (2009)
av: Haase, C, et al.
Publicerad: (2009)