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...
主要な著者: | Blondin, M, Haase, CJ, Offtermatt, P |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Springer
2021
|
類似資料
-
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
著者:: Haase, C, 等
出版事項: (2017) -
The reachability problem for two-dimensional vector addition systems with states
著者:: Blondin, M, 等
出版事項: (2021) -
The Complexity of Reachability in Affine Vector Addition Systems with States
著者:: Michael Blondin, 等
出版事項: (2021-07-01) -
Optimal Strategies in Infinite-state Stochastic Reachability Games
著者:: Václav Brožek
出版事項: (2011-06-01) -
Reachability for infinite time Turing machines with long tapes
著者:: Merlin Carl, 等
出版事項: (2020-04-01)