Goal-Driven Unfolding of Petri Nets - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Goal-Driven Unfolding of Petri Nets


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.
Fichier principal
Vignette du fichier
godunf.pdf (628.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01392203 , version 1 (29-06-2017)
hal-01392203 , version 2 (04-07-2017)





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⟩
563 View
217 Download



Gmail Facebook X LinkedIn More