Abstract
In this paper, we define a process semantics of P/T-nets with inhibitor arcs (PTI-nets). For PTI-nets with bounded inhibiting places, we combine the existing approaches for ordinary P/T-nets and for elementary net systems with inhibitor arcs. To deal with unbounded inhibiting places, a new feature has to be added to the underlying occurrence nets. In either case we show how to construct a process from a step sequence and give a complete characterization of all processes which can be obtained in this way. Using these processes it is possible to express the causal relationships between events in a PTI-net behaviour.
This research was supported by a grant from the Netherlands Organization for Scientific Research (NWO) and the British Council.
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
E. Best and R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55 (1988) 87–136.
E. Best and C. Fernández: Nonsequential Processes. A Petri Net View. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1988).
N. Busi and G. M. Pinna: Process Semantics for Place/Transition Nets with Inhibitor and Read Arcs. Fundamenta Informaticae 40 (1999) 165–197.
R. Fräisse: Theory of Relations. North Holland (1986).
H. Gaifman and V. Pratt: Partial Order Models of Concurrency and the Computation of Function. Proc. of LICS’87, IEEE Computer Society Press (1987) 72–85.
U. Goltz and W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control 57 (1983) 125–147.
R. Janicki and M. Koutny: Structure of Concurrency. Theoretical Computer Science 112 (1993) 5–52.
R. Janicki and M. Koutny: Semantics of Inhibitor Nets. Information and Computation 123 (1995) 1–16.
R. Janicki and M. Koutny: Order Structures and Generalisations of Szpilrajn’s Theorem. Acta Informatica 34 (1997) 367–388.
R. Janicki and M. Koutny: On Causality Semantics of Nets with Priorities. Fundamenta Informaticae 38 (1999) 1–33.
M. Nielsen, G. Rozenberg and P. S. Thiagarajan: Behavioural Notions for Elementary Net Systems. Distributed Computing 4 (1990) 45–57.
J. L. Peterson: Petri Net Theory and the Modeling of Systems. Prentice Hall (1981).
E. Szpilrajn: Sur l’extension de l’ordre partiel. Fundamenta Mathematicae 16 (1930) 386–389.
G. Rozenberg and J. Engelfriet: Elementary Net Systems. In: Advances in Petri Nets. Lectures on Petri Nets I: Basic Models, W. Reisig and G. Rozenberg (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1491 (1998) 12–121.
W. Vogler: Partial Order Semantics and Read Arcs. Proc. of MFCS’97, I. Privara and P. Ruzicka (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1295 (1997) 508–517.
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
Kleijn, J., Koutny, M. (2000). Process Semantics of P/T-Nets with Inhibitor Arcs. 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_16
Download citation
DOI: https://doi.org/10.1007/3-540-44988-4_16
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