License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.FSFMA.2013.47
URN: urn:nbn:de:0030-drops-40875
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4087/
Rodríguez, César ;
Schwoon, Stefan
An Improved Construction of Petri Net Unfoldings
Abstract
Petri nets are a well-known model language for concurrent systems.
The unfolding of a Petri net is an acyclic net bisimilar to the original one. Because it is acyclic, it admits simpler decision problems though it is in general larger than the net. In this paper, we revisit the problem of efficiently constructing an unfolding. We propose a new method that avoids computing the concurrency relation and therefore uses less memory than some other methods but still represents a good time-space tradeoff. We implemented the approach
and report on experiments.
BibTeX - Entry
@InProceedings{rodrguez_et_al:OASIcs:2013:4087,
author = {C{\'e}sar Rodr{\'i}guez and Stefan Schwoon},
title = {{An Improved Construction of Petri Net Unfoldings}},
booktitle = {1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013)},
pages = {47--52},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-939897-56-9},
ISSN = {2190-6807},
year = {2013},
volume = {31},
editor = {Christine Choppy and Jun Sun},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4087},
URN = {urn:nbn:de:0030-drops-40875},
doi = {10.4230/OASIcs.FSFMA.2013.47},
annote = {Keywords: Concurrency, Petri nets, partial orders, unfoldings}
}
|
Keywords: |
|
Concurrency, Petri nets, partial orders, unfoldings |
|
Collection: |
|
1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013) |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
14.07.2013 |
