Corpus ID: 57189529

VASS reachability in three steps

@article{Lasota2018VASSRI,
  title={VASS reachability in three steps},
  author={Slawomir Lasota},
  journal={ArXiv},
  year={2018},
  volume={abs/1812.11966}
}
  • Slawomir Lasota
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • This note is a product of digestion of the famous proof of decidability of the reachability problem for vector addition systems with states (VASS), as first established by Mayr in 1981 and then simplified by Kosaraju in 1982. The note is neither intended to be rigorously formal nor complete; it is rather intended to be an intuitive but precise enough description of main concepts exploited in the proof. Very roughly, the overall idea is to provide a decidable condition Theta on a VASS such that… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    KReach: A Tool for Reachability in Petri Nets

    VIEW 1 EXCERPT
    CITES BACKGROUND

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

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES