3 Hits in 1.3 sec

KReach: A Tool for Reachability in Petri Nets [chapter]

Alex Dixon, Ranko Lazić
2020 Lecture Notes in Computer Science  
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.  ...  KReach serves as a practical tool, and acts as an effective teaching aid for the theory behind the algorithm.  ...  We seek to address this gap by making the following contributions: -We present a tool, KReach, which we believe to be the first complete implementation of a decision procedure for the general Petri net  ... 
doi:10.1007/978-3-030-45190-5_22 fatcat:4vbpzzrf3vffdfaage7j5brxgm

Directed Reachability for Infinite-State Systems [article]

Michael Blondin, Christoph Haase, Philip Offtermatt
2020 arXiv   pre-print
In this paper, we introduce a novel approach for efficiently semi-deciding the reachability problem for Petri nets in practice.  ...  Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets.  ...  Acknowledgments We thank Juliette Fournis d'Albiat for her help with extracting the sypet suite. Directed Reachability for Infinite-State Systems  ... 
arXiv:2010.07912v1 fatcat:rihqujwwgjfbdh2wyuz27scm2i

A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking [article]

Nicolas Amat
2022 arXiv   pre-print
Our approach consists in transforming a reachability problem about some Petri net, into the verification of an updated reachability property on a reduced version of this net.  ...  We define a new method for taking advantage of net reductions in combination with a SMT-based model checker.  ...  It is in fact a feat that this algorithm has been implemented at all, see e.g. the tool KREACH [37] .  ... 
arXiv:2104.09850v3 fatcat:fqyta3yntbgcdjy4yh33xut2oy