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