# Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension

@article{Leroux2019ReachabilityIV, title={Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension}, author={J{\'e}r{\^o}me Leroux and S. Schmitz}, journal={2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}, year={2019}, pages={1-13} }

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… Expand

#### 34 Citations

Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free

- Computer Science
- CONCUR
- 2020

Reachability in fixed dimension vector addition systems with states

- Computer Science, Mathematics
- CONCUR
- 2020

Continuous One-Counter Automata

- Computer Science
- 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2021

The Reachability Problem for Petri Nets Is Not Elementary

- Computer Science
- J. ACM
- 2021

The Complexity of Reachability in Affine Vector Addition Systems with States

- Computer Science
- LICS
- 2020

#### References

SHOWING 1-10 OF 32 REFERENCES

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

- Computer Science, Mathematics
- 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2016

Vector Addition Systems Reachability Problem (A Simpler Solution)

- Computer Science, Mathematics
- Turing-100
- 2012

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete

- Mathematics, Computer Science
- 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
- 2015

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

- Mathematics, Computer Science
- 2009 24th Annual IEEE Symposium on Logic In Computer Science
- 2009

Demystifying Reachability in Vector Addition Systems

- Mathematics, Computer Science
- 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
- 2015

Reachability in Succinct and Parametric One-Counter Automata

- Mathematics, Computer Science
- CONCUR
- 2009