The reachability problem for two-dimensional vector addition systems with states
We prove that the reachability problem for two-dimensional vector addition systems with states is NL-complete or PSPACE-complete, depending on whether the numbers in the input are encoded in unary or binary. As a key underlying technical result, we show that, if a configuration is reachable, then th...
主要な著者: | Blondin, M, Englert, M, Finkel, A, Göller, S, Haase, C, Lazic, R, McKenzie, P, Totzke, P |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Association for Computing Machinery
2021
|
類似資料
-
A polynomial-time algorithm for reachability in branching VASS in dimension one
著者:: Göller, S, 等
出版事項: (2016) -
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
著者:: Haase, C, 等
出版事項: (2017) -
The Complexity of Reachability in Affine Vector Addition Systems with States
著者:: Michael Blondin, 等
出版事項: (2021-07-01) -
Directed reachability for infinite-state systems
著者:: Blondin, M, 等
出版事項: (2021) -
Vector Addition System Reversible Reachability Problem
著者:: Jérôme Leroux
出版事項: (2013-02-01)