Abstract
A causality semantics for weighted Place/Transition nets with weighted inhibitor arcs (PTI-nets) is proposed, by extending the standard approach based on the process semantics given through net unfolding and occurrence nets. It is demonstrated how processes corresponding to step sequences of PTI-nets can be constructed, and a nonalgorithmic (axiomatic) characterisation is given of the processes that can be obtained in this way. Moreover, a framework is established allowing to separately consider behaviours, processes and causality, in order to facilitate the discussion of their mutual consistency for different Petri net classes.
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
M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli and G. Franceschinis: Generalized Stochastic Petri Nets. Wiley (1995).
P. Baldan, N. Busi A. Corridani and G. M. Pinna: Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs. Proc. of CONCUR 2000, Springer-Verlag, LNCS 1877 (2000) 442–457.
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).
J. Billington: Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets. In: Part II of [17] (1998) 331–385.
N. Busi and G. M. Pinna: Process Semantics for Place/Transition Nets with Inhibitor and Read Arcs. Fundamenta Informaticae 40 (1999) 165–197.
G. Chiola, S. Donatelli, G. Franceschinis: Priorities, Inhibitor Arcs, and Concurrency in P/TN ets. Proc. of ICATPN’1991, Gjern (1991) 182–205.
S. Donatelli and G. Franceschinis: Modelling and Analysis of Distributed Software Using GSPNs. In: Part II of [17] (1998) 438–476.
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 CS Press (1987) 72–85.
U. Goltz and W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control 57 (1983) 125–147.
M. H. T. Hack: Decidability Questions for Petri Nets. PhD Thesis, M. I. T. (1976).
R. Janicki and M. Koutny: Semantics of Inhibitor Nets. Information and Computation 123 (1995) 1–16.
H. C. M. Kleijn and M. Koutny: Process Semantics of P/T-Nets with Inhibitor Arcs. Proc. of ICATPN’2000, Springer-Verlag, LNCS 1825 (2000) 261–281.
H. C. M. Kleijn and M. Koutny: Process Semantics of General Inhibitor Nets. Technical Report CS-TR-769, Dept. of Comp. Sci., University of Newcastle (2002).
J. L. Peterson: Petri Net Theory and the Modeling of Systems. Prentice Hall (1981).
W. Reisig and G. Rozenberg (Eds.): Lectures on Petri Nets. Springer-Verlag, LNCS1491&1492 (1988).
G. Rozenberg and J. Engelfriet: Elementary Net Systems. In: Part I of [17] (1998) 12–121.
W. Vogler: Executions: a New Partial-order Semantics of Petri Nets. Theoretical Computer Science 91 (1991) 205–238.
W. Vogler: Partial Order Semantics and Read Arcs. Proc. of MFCS’97, Springer-Verlag, LNCS 1295 (1997) 508–517.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kleijn, H.C.M., Koutny, M. (2002). Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_35
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive