Abstract
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work of Winskel on safe nets, the truly concurrent semantics is given at a categorical level via a chain of functors leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime algebraic domains. As an intermediate semantic model, we introduce inhibitor event structures, an extension of prime event structures able to faithfully capture the dependencies among events which arise in the presence of read and inhibitor arcs.
Research partly supported by the TMR Network GETGRATS, by the Esprit Working Groups APPLIGRAPH and by the MURST project TOSCA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. Agerwala and M. Flynn. Comments on capabilities, limitations and “correctness” of Petri nets. Computer Architecture News, 4(2):81–86, 1973.
P. Baldan. Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD thesis, Department of Computer Science, University of Pisa, 2000.
P. Baldan, N. Busi, A. Corradini, and G. M. Pinna. Domain and event structure semantics for Petri nets with read and inhibitor arcs. Technical report TR-00-05, Department of Computer Science, University of Pisa, 2000.
P. Baldan, A. Corradini, and U. Montanari. An event structure semantics for P/T contextual nets: Asymmetric event structures. Proceedings of FoSSaCS’ 98, LNCS 1378. Springer, 1998.
G. Boudol. Flow Event Structures and Flow Nets. In Semantics of System of Concurrent Processes, LNCS 469. Springer, 1990.
N. Busi and G. M. Pinna. Process semantics for Place/Transition nets with inhibitor and read arcs. Fundamenta Informaticœ, 40(2–3):165–197, 1999.
S. Christensen and N. D. Hansen. Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. Applications and Theory of Petri Nets, LNCS 691. Springer, 1993.
R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123:1–16, 1995.
R. Langerak. Transformation and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente, 1992.
J. Meseguer, U. Montanari, and V. Sassone. Process versus unfolding semantics for Place/Transition Petri nets. Theoret. Comp. Sci., 153(1–2):171–210, 1996.
U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32(6), 1995.
M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoret. Comp. Sci., 13:85–108, 1981.
J. L. Peterson. Petri Net Theory and the Modelling of Systems. Prentice-Hall, 1981.
G. M. Pinna and A. Poigné. On the nature of events: another perspective in concurrency. Theoret. Comp. Sci., 138(2):425–454, 1995.
W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer, 1985.
W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In Proceedings of ICALP’97, LNCS 1256. Springer, 1997.
W. Vogler, A. Semenov, and A. Yakovlev. Unfolding and finite prefix for nets with read arcs. In Proceedings of CONCUR’98, LNCS 1466. Springer, 1998.
G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255. Springer, 1987.
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
Baldan, P., Busi, N., Corradini, A., Michele Pinna, G. (2000). Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-44618-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67897-7
Online ISBN: 978-3-540-44618-7
eBook Packages: Springer Book Archive