The Complexity of Reachability in Affine Vector Addition Systems with States

@article{Blondin2020TheCO,
  title={The Complexity of Reachability in Affine Vector Addition Systems with States},
  author={Michael Blondin and Mikhail Raskin},
  journal={Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
  year={2020}
}
  • Michael Blondin, Mikhail Raskin
  • Published 5 September 2019
  • Mathematics
  • Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches have relied on techniques such as reachability relaxations, e.g., allowing for negative intermediate counter values. It is natural to question their feasibility for VASS enriched with primitives that typically translate into undecidability. Spurred by this concern, we pinpoint the complexity of integer relaxations w.r… 

Figures from this paper

On Affine Reachability Problems
TLDR
A number of complexity results are obtained, including NP-completeness of the mortality problem for matrices with determinants +1 and 0, and algorithmic problems in finitely generated semigroups of 2-dimensional upper-triangular integer matrices.
The ABCs of petri net reachability relaxations
TLDR
This work surveys relaxations that alleviate the tremendous complexity of deciding configuration reachability in classical Petri nets and for extensions with affine transformations, branching rules and colored tokens.
Parameterized Repair of Concurrent Systems
TLDR
It is shown that parameterized deadlock detection can be decided in NEXPTIME for disjunctive systems, vastly improving on the best known lower bound, and that it is in general undecidable for broadcast protocols.
The Well Structured Problem for Presburger Counter Machines
TLDR
It is shown that it is undecidable for most of the (Presburger-defined) counter machines except for Affine VASS of dimension one, but the strong well structured problem is decidable for all Presburger counter machines.

References

SHOWING 1-10 OF 37 REFERENCES
Integer Vector Addition Systems with States
TLDR
It turns out that while the addition of reset operations to ordinary VASS leads to undecidability and Ackermann-hardness of reachability and coverability, respectively, they can be added to ℤ-VASS while retaining NP-completeness of both coverability and reachability.
Affine Extensions of Integer Vector Addition Systems with States
TLDR
It is shown that, in a particular case, the reachability problem is decidable for this class, disproving a conjecture about affine $\mathbb{Z}$-VASS with infinite matrix monoids the authors raised in a preliminary version of this paper.
Logics for continuous reachability in Petri nets and vector addition systems with states
TLDR
It is proved that reachability sets of CVASS are equivalent to the sets of rational numbers definable in existential FO(ℚ,+,<) from which it is concluded that reachable in CVASS is NP-complete.
How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property?
TLDR
This work provides complexity bounds for several decision problems of counter systems with guards defined by convex polyhedra and updates defined by affine transformations, by proving that reachability and model checking for Past Linear Temporal Logic stands in the second level of the polynomial hierarchy.
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
  • Jérôme Leroux
  • Mathematics
    2009 24th Annual IEEE Symposium on Logic In Computer Science
  • 2009
TLDR
This paper proves that the Parikh images of languages accepted by VASs are semi-pseudo-linear; a class that extends the semi-linear sets, a.k.a. the sets definable in the Presburger arithmetic, and deduces that there exist checkable certificates of non-reachability.
Vector Addition Systems Reachability Problem (A Simpler Solution)
TLDR
New intermediate results are proposed that dramatically simplify the first proof of the VAS reachability problem that is not based on the KLMST decomposition and the notion of production relations that directly proves the existence of Presburger inductive invariants.
Vector addition system reachability problem: a short self-contained proof
TLDR
The first proof of the VAS reachability problem that is not based on the KLMST decomposition is provided using the notion of production relations inspired from Hauschildt that directly provides the existence of Presburger inductive invariants.
The reachability problem for Petri nets is not elementary
TLDR
A non-elementary lower bound is established, i.e. that the reachability problem needs a tower of exponentials of time and space, which implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachable problem, are also not elementary.
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
  • Jérôme LerouxS. Schmitz
  • Computer Science, Mathematics
    2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2019
TLDR
This work provides 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.
The Reachability Problem Requires Exponential Space
  • Technical Report 63
  • 1976
...
...