 |
Conference papers
Goal-Driven Unfolding of Petri Nets
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.
Cited literature [18 references]
https://hal.archives-ouvertes.fr/hal-01392203
Contributor : Loïc Paulevé <>
Submitted on : Tuesday, July 4, 2017 - 4:08:50 PM
Last modification on : Tuesday, April 21, 2020 - 1:10:36 AM
Document(s) archivé(s) le : Tuesday, January 23, 2018 - 6:42:24 PM
Contributor : Loïc Paulevé <>
Submitted on : Tuesday, July 4, 2017 - 4:08:50 PM
Last modification on : Tuesday, April 21, 2020 - 1:10:36 AM
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
