Abstract
This paper describes a Petri net model, called Coloured Petri nets (CP-nets), where information is attached to each token. The information can be inspected and modified when a transition fires. For most applications, this generalization of ordinary Petri nets allows the user to make more manageable descriptions, due to the fact that equal subnets can be folded into each other, yielding a much smaller net. The paper investigates how to analyse Coloured Petri nets. It turns out that place-invariants and reachability trees, two of the most important methods for ordinary Petri nets, can be generalized to apply for Coloured Petri nets.
Coloured Petri nets and Predicate/transition-nets are very closely related to each other, in the sense that Coloured Petri nets have been developed as a modification of Predicate/transition-nets, in order to avoid some technical problems which arise when the method of place-invariants is generalized to apply for Predicate/transition-nets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. J. Genrich and K. Lautenbach: System modelling with high-level Petri nets. Theoretical Computer Science 13 (1981), 109–136.
M. Hack: Decidability questions for Petri nets. TR 161, MIT, 1976.
P. Huber, A. M. Jensen, L. O. Jepsen and K. Jensen: Reachability trees for high-level Petri nets. Theoretical Computer Science 45 (1986).
K. Jensen: Coloured Petri nets and the invariant-method. Theoretical Computer Science 14 (1981), 317–336.
K. Jensen: How to find invariants for coloured Petri nets. In: J. Gruska, M. Chytill (eds.): Mathematical Foundations of Computer Science 1981, Lecture Notes in Computer Science vol. 118, Springer-Verlag, 1981, 327-338.
K. Jensen: High-level Petri nets. In: A. Pagnoni and G. Rozenberg (eds.): Applications and Theory of Petri Nets, Informatik-Fachberichte vol. 66, Springer-Verlag, 1983, 166-180.
R. M. Karp and R. E. Miller: Parallel program schemata. Journal of Computer and System Sciences, vol. 3, 1969, 147–195.
K. Lautenbach: Liveness in Petri nets, Interner Bericht ISF-75-02. 1, GDM Bonn, 1975.
G. Memmi and G. Roucairol: Linear algebra in net theory. In: W. Brauer (ed.), Net theory and applications, Lecture Notes in Computer Science vol. 84, Springer-Verlag, 1980, 213-223.
H. Oberquelle: Communication by graphic net representations, Bericht Nr. 75, Fachbereich Informatik, Universität Hamburg, 1981.
J. L. Peterson: Petri net theory and the modeling of systems. Prentice-Hall, 1981.
W. Reisig: Petri nets with individual tokens. Theoretical Computer Science 41 (1985), 185–213.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jensen, K. (1987). Coloured Petri Nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Central Models and Their Properties. ACPN 1986. Lecture Notes in Computer Science, vol 254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47919-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-47919-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17905-4
Online ISBN: 978-3-540-47919-2
eBook Packages: Springer Book Archive