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)