eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-12-04
47:1
47:14
10.4230/LIPIcs.FSTTCS.2019.47
article
Distance Between Mutually Reachable Petri Net Configurations
Leroux, Jérôme
1
LaBRI, CNRS, Univ. Bordeaux, France
Petri nets are a classical model of concurrency widely used and studied in formal verification with many applications in modeling and analyzing hardware and software, data bases, and reactive systems. The reachability problem is central since many other problems reduce to reachability questions. In 2011, we proved that a variant of the reachability problem, called the reversible reachability problem is exponential-space complete. Recently, this problem found several unexpected applications in particular in the theory of population protocols. In this paper we revisit the reversible reachability problem in order to prove that the minimal distance in the reachability graph of two mutually reachable configurations is linear with respect to the Euclidean distance between those two configurations.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol150-fsttcs2019/LIPIcs.FSTTCS.2019.47/LIPIcs.FSTTCS.2019.47.pdf
Petri nets
Vector addition systems
Formal verification
Reachability problem