HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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], Inria Saclay - Ile de France
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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

Contributor : Loïc Paulevé Connect in order to contact the contributor
Submitted on : Tuesday, July 4, 2017 - 4:08:50 PM
Last modification on : Thursday, July 8, 2021 - 3:50:31 AM
Long-term archiving on: : Tuesday, January 23, 2018 - 6:42:24 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads