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...
Prif Awduron: | Blondin, M, Haase, CJ, Offtermatt, P |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Springer
2021
|
Eitemau Tebyg
-
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
gan: Haase, C, et al.
Cyhoeddwyd: (2017) -
The reachability problem for two-dimensional vector addition systems with states
gan: Blondin, M, et al.
Cyhoeddwyd: (2021) -
The Complexity of Reachability in Affine Vector Addition Systems with States
gan: Michael Blondin, et al.
Cyhoeddwyd: (2021-07-01) -
Optimal Strategies in Infinite-state Stochastic Reachability Games
gan: Václav Brožek
Cyhoeddwyd: (2011-06-01) -
Reachability for infinite time Turing machines with long tapes
gan: Merlin Carl, et al.
Cyhoeddwyd: (2020-04-01)