Leroux, Jerome; Schmitz, Sylvain Demystifying reachability in vector addition systems. (English) Zbl 1392.68308 Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 56-67 (2015). Cited in 17 Documents MSC: 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) 68Q25 Analysis of algorithms and problem complexity 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:reachability analysis; computational complexity; decidability; Petri nets; program verification PDF BibTeX XML Cite \textit{J. Leroux} and \textit{S. Schmitz}, in: Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6--10, 2015. Los Alamitos, CA: IEEE Computer Society. 56--67 (2015; Zbl 1392.68308) Full Text: DOI