Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
arXiv:1903.08575 · doi:10.1109/LICS.2019.8785796
Abstract
The reachability problem in vector addition systems is a central question, not only for the static verification of these systems, but also for many inter-reducible decision problems occurring in various fields. The currently best known upper bound on this problem is not primitive-recursive, even when considering systems of fixed dimension. We provide significant refinements to the classical decomposition algorithm of Mayr, Kosaraju, and Lambert and to its termination proof, which yield an ACKERMANN upper bound in the general case, and primitive-recursive upper bounds in fixed dimension. While this does not match the currently best known TOWER lower bound for reachability, it is optimal for related problems.
References in corpus (8)
- Demystifying Reachability in Vector Addition Systems
- Complexity Hierarchies Beyond Elementary
- Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete
- The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
- Complexity Bounds for Ordinal-Based Termination
- An approach to computing downward closures
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
- Unboundedness problems for languages of vector addition systems