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 Sylvain Schmitz},
  journal={2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  year={2019},
  pages={1-13}
}
  • Jérôme Leroux, Sylvain Schmitz
  • Published 2019
  • Computer Science, Mathematics
  • 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 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… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 19 CITATIONS

    When Reachability Meets Grzegorczyk

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    KReach: A Tool for Reachability in Petri Nets

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    Structural liveness of Petri nets is ExpSpace-hard and decidable

    VIEW 1 EXCERPT
    CITES BACKGROUND

    On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    The complexity of reachability in vector addition systems

    VIEW 2 EXCERPTS

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

    VIEW 1 EXCERPT

    Vector Addition Systems Reachability Problem (A Simpler Solution)

    VIEW 2 EXCERPTS

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

    VIEW 1 EXCERPT

    The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

    • Jérôme Leroux
    • Mathematics, Computer Science
    • 2009 24th Annual IEEE Symposium on Logic In Computer Science
    • 2009

    Demystifying Reachability in Vector Addition Systems

    VIEW 3 EXCERPTS

    VASS reachability in three steps

    VIEW 1 EXCERPT