Goal-Driven Unfolding of Petri Nets

Thomas Chatain 1, 2 Loïc Paulevé 3
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
3 BioInfo - LRI - Bioinformatique (LRI)
LRI - Laboratoire de Recherche en Informatique
Abstract : Unfoldings provide an efficient way to avoid the state-space explosion due to interleavings of concurrent transitions when exploring the runs of a Petri net. The theory of adequate orders allows one to define finite prefixes of unfoldings which contain all the reachable markings. In this paper we are interested in reachability of a single given marking, called the goal. We propose an algorithm for computing a finite prefix of the unfolding of a 1-safe Petri net that preserves all minimal configurations reaching this goal. Our algorithm combines the unfolding technique with on-the-fly model reduction by static analysis aiming at avoiding the exploration of branches which are not needed for reaching the goal. We present some experimental results.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01392203
Contributor : Loïc Paulevé <>
Submitted on : Tuesday, July 4, 2017 - 4:08:50 PM
Last modification on : Friday, April 27, 2018 - 2:36:02 PM
Document(s) archivé(s) le : Tuesday, January 23, 2018 - 6:42:24 PM

File

godunf.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Thomas Chatain, Loïc Paulevé. Goal-Driven Unfolding of Petri Nets. 28th International Conference on Concurrency Theory (CONCUR 2017), Sep 2017, Berlin, Germany. ⟨10.4230/LIPIcs.CONCUR.2017.14⟩. ⟨hal-01392203v2⟩

Share

Metrics

Record views

367

Files downloads

112