OASIcs.FSFMA.2013.47.pdf
- Filesize: 407 kB
- 6 pages
Document
An Improved Construction of Petri Net Unfoldings
Authors
-
Part of:
Volume:
1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-07-14
Cite As Get BibTex
César Rodríguez and Stefan Schwoon. An Improved Construction of Petri Net Unfoldings. In 1st French Singaporean Workshop on Formal Methods and Applications (FSFMA 2013). Open Access Series in Informatics (OASIcs), Volume 31, pp. 47-52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/OASIcs.FSFMA.2013.47
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.
Subject Classification
Keywords
- Concurrency
- Petri nets
- partial orders
- unfoldings
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads