Abstract
We present KReach, a tool for deciding reachability in general Petri nets. The tool is a full implementation of Kosaraju’s original 1982 decision procedure for reachability in VASS. We believe this to be the first implementation of its kind. We include a comprehensive suite of libraries for development with Vector Addition Systems (with States) in the Haskell programming language. KReach serves as a practical tool, and acts as an effective teaching aid for the theory behind the algorithm. Preliminary tests suggest that there are some classes of Petri nets for which we can quickly show unreachability. In particular, using KReach for coverability problems, by reduction to reachability, is competitive even against state-of-the-art coverability checkers.
Author supplied keywords
Cite
CITATION STYLE
Dixon, A., & Lazić, R. (2020). Kreach: A tool for reachability in petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12078 LNCS, pp. 405–412). Springer. https://doi.org/10.1007/978-3-030-45190-5_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
