Coloured Petri Nets extended with channels for synchronous communication
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are allowed to communicate complex values. Small examples show how channel communication is convenient for creating compact and comprehensive models.
The concepts introduced in this paper originate from the practical use of Petri nets for modelling, and they are formally defined in such a way that they preserve the basic properties of CP-nets. We show how a CP-net with channels can be transformed into a behaviourally equivalent CP-net. This allows us to deduce properties of CP-nets with channels from well-known properties of CP-nets. As an example, we extend the concept of place invariants to cope with CP-nets with channels and show how place invariants can be found. This is done without transforming the CP-nets with channels into their equivalent CP-nets.
The reader is assumed to be familiar with the notion of CP-nets.
KeywordsColoured Petri nets synchronous communication channels modular specifications re-usable models invariant analysis
Unable to display preview. Download preview PDF.
- [CD92]S. Christensen, N. Damgaard Hansen: Coloured Petri nets extended with channels for synchronous communication. Daimi PB-390, ISSN 0105-8517, April 1992. Available as: Daimi PB-390, ISSN 0105-8517, April 1992.Google Scholar
- [CP92]S. Christensen, L. Petrucci: Towards a modular analysis of coloured Petri nets. In: K. Jensen (ed.): Application and Theory of Petri Nets 1992. Lecture Notes in Computer Science, vol. 616, Springer-Verlag, 1992, 113–133.Google Scholar
- [HT91]T. Hildebrand and N. Trèves: S-CORT: A method for the development of electronic payment systems. In: G. Rozenberg (ed.): Advances in Petri Nets 1989, Lecture Notes in Computer Science vol. 424, Springer-Verlag 1990, 262–280.Google Scholar
- [Hoa85]C. A. R. Hoare: Communicating sequential processes ISBN 0-13-153289-8, Prentice Hall, 1985.Google Scholar
- [HJS90]P. Huber, K. Jensen and R. M. Shapiro: Hierarchies in coloured Petri nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol. 383, Springer-Verlag, 1990, 342–416. Also in [JR91], 215–243.Google Scholar
- [Jen81]K. Jensen: Coloured Petri nets and the invariant method. Theoretical Computer Science 14 (1981), Springer-Verlag 1981, 317–336.Google Scholar
- [Jen86]K. Jensen: Coloured Petri 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, 248–299.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, 342–416. Also in [JR91], 44–119.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
- [JR91]K. Jensen and G. Rozenberg (eds.): High-level Petri nets: theory and application. Springer-Verlag 1991. ISBN 3-540-54125-X/0-387-54125-X.Google Scholar
- [Mil89]R. Milner: Communication and concurrency. ISBN 0-13-114984-9, Prentice Hall, 1989.Google Scholar