Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete*

@article{Englert2016ReachabilityIT,
  title={Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete*},
  author={Matthias Englert and R. Lazic and P. Totzke},
  journal={2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  year={2016},
  pages={1-8}
}
Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length exponential in the number of states and polynomial in the norm of vectors. The resulting guess-and-verify algorithm is optimal (PSPACE), but only if the input vectors are given in binary. We answer positively the main question left open by their work, namely establish that reachability witnesses of pseudo-polynomial length always exist. Hence, when the input vectors… Expand
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
  • Jérôme Leroux, S. Schmitz
  • Mathematics, Computer Science
  • 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2019
Reachability in fixed dimension vector addition systems with states
Reachability for Bounded Branching VASS
Algorithmic Complexity of Well-Quasi-Orders
...
1
2
...

References

SHOWING 1-3 OF 3 REFERENCES
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
Demystifying Reachability in Vector Addition Systems
The complexity of reachability in vector addition systems