2026-07-21T21:09:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7773 2024-03-06T10:41:08Z ddc:004 open_access

Goal-Driven Unfolding of Petri Nets Chatain, Thomas Paulevé, Loïc model reduction; reachability; concurrency; unfoldings; Petri nets; automata networks 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Thomas Chatain and Loïc Paulevé 2017 Is Part Of LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2017.18 urn:nbn:de:0030-drops-77730 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.18 eng https://creativecommons.org/licenses/by/3.0/legalcode