Abstract
In this paper we address the following question: What type of event structures are suitable for representing the behaviour of general Petri nets? We provide a partial answer to this question here. Our answer is partial in that we propose a new class of event structures, called OL-event structures, and show that OLevent structures can be used to represent the behaviour of Petri nets, provided auto-concurrency is filtered out from the behaviour of Petri nets. It turns out that this limited event structure semantics for Petri nets is nevertheless a nontrivial and conservative extension of the (prime) event structure semantics of 1-safe Petri nets provided in [NPW]. We also show that the strong relationship between prime event structures and 1-safe Petri nets established in a categorical framework in [W2] can be extended to the present setting, provided we restrict our attention to the subclass of Petri nets whose behaviours do not exhibit any auto-concurrency.
Preview
Unable to display preview. Download preview PDF.
References
Boudol, G., (1990), Flow event structures and flow nets, Lecture Notes in Computer Science 469, 62–95.
Engelfriet, J., (1991), Branching processes of Petri nets, Acta Informatica, v. 28, 575–591.
Ehrenfeucht, A., and Rozenberg, G., (1990), Partial 2-structures; part II: state spaces of concurrent systems, Acta Informatica, v. 27, 348–368.
Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., (1992), A trace semantics for Petri nets, Leiden University Techn. Rep. 92-03.
Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., (1993), A restricted event structure semantics for Petri nets, Leiden University Techn. Rep. 93-13.
Meseguer, J., and Montanari, U., (1990), Petri nets are monoids, Information and Computation 88, 105–155.
Meseguer, J., Montanari, U., and Sassone, V., (1992), On the semantics of Petri nets, Lecture Notes in Computer Science 630, 286–301.
Mukund, M., (1992), Petri nets and step transition systems, to appear in Int. J. Foundations of Computer Science.
Nielsen, M., Plotkin, G., and Winskel, G., (1981), Petri nets, event structures and domains, part I, Theoretical Computer Science 13, 85–108.
Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., (1992), Elementary transition systems, Theoretical Computer Science 96, 3–33.
Winskel, G., (1987), Petri nets, algebras, morphisms, and compositionality, Information and Computation 72, 197–238.
Winskel, G., (1987), Event structures, Lecture Notes in Computer Science 255, 325–392.
Winskel, G., and Nielsen, M., (1992), Models for concurrency, to appear in S. Abramsky, D.M. Gabbay, T.S.E. Maibaum eds., Handbook of Logic in Computer Science.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S. (1993). Local event structures and Petri nets. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive