License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.18
URN: urn:nbn:de:0030-drops-77730
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7773/
Go to the corresponding LIPIcs Volume Portal


Chatain, Thomas ; Paulevé, Loïc

Goal-Driven Unfolding of Petri Nets

pdf-format:
LIPIcs-CONCUR-2017-18.pdf (0.6 MB)


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.

BibTeX - Entry

@InProceedings{chatain_et_al:LIPIcs:2017:7773,
  author =	{Thomas Chatain and Loic Paulev{\'e}},
  title =	{{Goal-Driven Unfolding of Petri Nets}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{18:1--18:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7773},
  URN =		{urn:nbn:de:0030-drops-77730},
  doi =		{10.4230/LIPIcs.CONCUR.2017.18},
  annote =	{Keywords: model reduction; reachability; concurrency; unfoldings; Petri nets; automata networks}
}

Keywords: model reduction; reachability; concurrency; unfoldings; Petri nets; automata networks
Seminar: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 25.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI