Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive and on the other hand easy to develop, understand and analyse. A number of different place capacity and inhibitor concepts have been suggested earlier, e.g., integer and multi-set capacities and zero-testing and threshold inhibitors. These concepts can all be described as special cases of the more general place capacity and inhibitor concepts defined in this paper.
We give an informal description of the new concepts and show how the concepts can be formally defined and integrated in the Petri net framework—keeping the basic properties of CP-nets. In contrast to a number of the previously suggested extensions to CP-nets the new modelling primitives preserve the concurrency properties of CP-nets. We show how CP-nets with place capacities, test arcs and inhibitor arcs can be transformed into behaviourally equivalent CP-nets without these primitives. From this we conclude that the basic properties of CP-nets are preserved and that the theory developed for CP-nets can be applied to the extended CP-nets. This means that, e.g., the generalisations of analysis methods of CP-nets to cover the new modelling primitives are straightforward.
The reader is assumed to be familiar with the notion of CP-nets.
KeywordsModelling Primitive Threshold Inhibitor Guard Function Capacity Projection Complementary Place
Unable to display preview. Download preview PDF.
- [Bil88]J. Billington: Extending Coloured Petri Nets. University of Cambridge, Computer Laboratory, Technical Report No. 148, October 1988. (Ph.D. Thesis).Google Scholar
- [CD92]S. Christensen, N. Damgaard Hansen: Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. Daimi PB-398, ISSN 0105-8517, May 1992. Available as: Daimi PB-398, ISSN 0105-8517, May 1992.Google Scholar
- [CDF91]G. Chiola, S. Donatelli and G. Franceschinis. Priorities, Inhibitor Arcs and Concurrency in P/T Nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus 1991, 182–205.Google Scholar
- [Dev89]R. Devillers: The Semantics of Capacities in P/T Nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1989. Lecture Notes in Computer Science, vol. 424. Springer-Verlag, 1989, pp. 128–150.Google Scholar
- [Gen86]H.J. Genrich: Predicate/Transition nets. In: W. Brauer, W. Reisig and G. Rozenberg (eds.): Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986 Part I, Lecture Notes in Computer Science vol. 254, Springer-Verlag 1987, 207–247.Google Scholar
- [GLT79]H.J. Genrich, K. Lautenbach and P.S. Thiagarajan: Elements of general net theory. In: W. Brauer (ed.): Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg 1979, Lecture Notes in Computer Science vol. 84, Springer-Verlag 1980, 21–163.Google Scholar
- [Jen91]K. Jensen: Coloured Petri nets: A high level language for system design and analysis. In: G. Rozenberg (ed.): Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol. 383. Springer-Verlag, 1990, pp. 342–416.Google Scholar
- [Jen92]K. Jensen: Coloured Petri nets. Basic concepts, analysis methods and practical use. Volume 1: Basic concepts. EATCS monographs on Theoretical Computer Science, Springer-Verlag 1992.Google Scholar
- [Res85]W. Reisig: Petri Nets. An introduction. EATCS Monographs on Theoretical Computer Science, Vol. 4, ISBN 3-540-13723-8 or 0-387-13723-8, Springer-Verlag, 1985.Google Scholar