Abstract
It is a well-known fact that for every k-safe Petri net, i.e. a Petri net in which no place contains more than k ∈ ℕ tokens under any reachable marking, there is a 1-safe Petri net with the same interleaving behaviour. Indeed these types of Petri nets generate regular languages. In this paper, we show that this equivalence of k-safe and 1-safe Petri nets holds also for their pomset languages, a true-concurrency semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Best: In Quest of a Morphism. Petri Net Newsletters Vol. 18, pp.14–18, 1984.
T. Emden-Weinert, S. Hougardy, B. Kreuter, H.J. Prömel, A. Steger: Einführung in Graphen und Algorithmen. Skriptum der Humboldt-Universität Berlin, 1996.
U. Goltz, U. Vogt: Processes of Relation Nets. Petri Net Newsletters Vol. 14, pp.10–19, 1983.
U. Goltz, W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control Vol. 57, pp.125–147, 1983.
J. Grabowski: On Partial Languages. Annales Societatis Mathematicae Polonae, Fundamenta Informaticae Vol. IV.2, pp.428–498, 1981.
K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1992.
E. Pelz: Normalization of Place/Transition Systems Preserves Net Behaviour. Informatique Théorique et Applications Vol. 26/1, pp.19–44, 1992.
L. Pomello, G. Rozenberg, C. Simone: A Survey of Equivalence Notions for Net Based Systems. Lecture Notes in Computer Science Vol. 609, pp.410–472, 1992.
V. Pratt: Modeling Concurrency with Partial Orders. International Journal of Parallel Processing no. 15, pp.33–71, 1986.
L. Priese, H. Wimmel: Algebraic Characterization of Petri Net Pomset Languages. Proceedings of CONCUR’97, Lecture Notes in Computer Science Vol. 1243, pp.406–420, 1997.
L. Priese, H. Wimmel: A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. Theoretical Computer Science Vol. 206, pp.219–256, 1998.
W. Reisig: Elements of Distributed Algorithms. Springer-Verlag, 1998.
E. Smith: Principles of High-level Net Theory. in: Lectures on Petri Nets I, Basic Models, Lecture Notes in Computer Science Vol. 1491, pp.174–210, 1998.
H. Tverberg: On Dilworth’s Decomposition Theorem for Partially Ordered Sets. J. of Combin. Theory Vol. 3, pp.305–306, 1967.
H. Wimmel: Algebraische Semantiken für Petri-Netze. Ph.D. Thesis, Universität Koblenz-Landau, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., Wimmel, H. (2000). Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-44988-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67693-5
Online ISBN: 978-3-540-44988-1
eBook Packages: Springer Book Archive