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...
Príomhchruthaitheoirí: | Blondin, M, Haase, CJ, Offtermatt, P |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Springer
2021
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
de réir: Haase, C, et al.
Foilsithe / Cruthaithe: (2017) -
The reachability problem for two-dimensional vector addition systems with states
de réir: Blondin, M, et al.
Foilsithe / Cruthaithe: (2021) -
The Complexity of Reachability in Affine Vector Addition Systems with States
de réir: Michael Blondin, et al.
Foilsithe / Cruthaithe: (2021-07-01) -
Optimal Strategies in Infinite-state Stochastic Reachability Games
de réir: Václav Brožek
Foilsithe / Cruthaithe: (2011-06-01) -
Reachability for infinite time Turing machines with long tapes
de réir: Merlin Carl, et al.
Foilsithe / Cruthaithe: (2020-04-01)