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