Coloured Petri nets. (English) Zbl 0632.68058
Petri nets: central models and their properties, Proc. Adv. Course, Bad Honnef/FRG 1986, Lect. Notes Comput. Sci. 254, 248-299 (1987).
[For the entire collection see Zbl 0619.00023.]
The paper gives a good introduction to a high level Petri net model called “coloured Petri nets” (CP-net). The classical Petri nets are generalized by attaching tokens with individual information (colours). For many applications this allows to give more managable descriptions in smaller nets by folding similar subnets into each other. The methods of place invariants and reachability trees (covering trees) are transferred to CP-nets and used to analyze several example systems. The paper is a very good, readable mixture of exact definition and theorems and clear informal motivations and relevant examples.
The paper gives a good introduction to a high level Petri net model called “coloured Petri nets” (CP-net). The classical Petri nets are generalized by attaching tokens with individual information (colours). For many applications this allows to give more managable descriptions in smaller nets by folding similar subnets into each other. The methods of place invariants and reachability trees (covering trees) are transferred to CP-nets and used to analyze several example systems. The paper is a very good, readable mixture of exact definition and theorems and clear informal motivations and relevant examples.
Reviewer: H.Müller
MSC:
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
