Skip to main content
SpringerLink
Log in

An introduction to the theoretical aspects of Coloured Petri Nets

  • Conference paper
  • First Online:
A Decade of Concurrency Reflections and Perspectives (REX 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 803))

Abstract

This paper presents the basic theoretical aspects of Coloured Petri Nets (CP-nets or CPN). CP-nets have been developed, from being a promising theoretical model, to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or computers communicate by means of some more or less formal rules). The paper contains the formal definition of CP-nets and their basic concepts (e.g., the different dynamic properties such as liveness and fairness). The paper also contains a short introduction to the analysis methods, in particular occurrence graphs and place invariants.

The development of CP-nets has been driven by the desire to develop a modelling language — at the same time theoretically well-founded and versatile enough to be used in practice for systems of the size and complexity that we find in typical industrial projects. To achieve this, we have combined the strength of Petri nets with the strength of programming languages. Petri nets provide the primitives for the description of the synchronisation of concurrent processes, while programming languages provide the primitives for the definition of data types and the manipulation of their data values.

The paper does not assume that the reader has any prior knowledge of Petri nets — although such knowledge will, of course, be a help.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Balbo, S.C. Bruell, P. Chen, G. Chiola: An Example of Modelling and Evaluation of a Concurrent Program Using Colored Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm. IEEE Transactions on Parallel and Distributed Systems, 3 (1992). Also in [30], 533–559.

    Google Scholar 

  2. J. Berger, L. Lamontagne: A Colored Petri Net Model for a Naval Command and Control System. In: M. Ajmone-Marsan (ed.): Application and Theory of Petri Nets 1993. Proceedings of the 14th International Petri Net Conference, Chicago 1993, Lecture Notes in Computer Science Vol. 691, Springer-Verlag 1993, 532–541.

    Google Scholar 

  3. C. Capellmann, H. Dibold: Petri Net Based Specifications of Services in an Intelligent Network. Experiences Gained from a Test Case Application. In: M. Ajmone-Marsan (ed.): Application and Theory of Petri Nets 1993. Proceedings of the 14th International Petri Net Conference, Chicago 1993, Lecture Notes in Computer Science Vol. 691, Springer-Verlag 1993, 542–551.

    Google Scholar 

  4. L. Cherkasova, V. Kotov, T. Rokicki: On Net Modelling of Industrial Size Concurrent Systems. In: M. Ajmone-Marsan (ed.): Application and Theory of Petri Nets 1993. Proceedings of the 14th International Petri Net Conference, Chicago 1993, Lecture Notes in Computer Science Vol. 691, Springer-Verlag 1993, 552–561.

    Google Scholar 

  5. L. Cherkasova, V. Kotov, T. Rokicki: On Scalable Net Modeling of OLTP. In PNPM93: Petri Nets and Performance Models. Proceedings of the 5th International Workshop, Toulouse, France 1993, IEEE Computer Society Press, 270–279.

    Google Scholar 

  6. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: On Well-Formed Coloured Nets and Their Symbolic Reachability Graph. In [30], 373–396.

    Google Scholar 

  7. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: A Symbolic Reachability Graph for Coloured Petri Nets. Submitted to Theoretical Computer Science.

    Google Scholar 

  8. S. Christensen, L.O. Jepsen: Modelling and Simulation of a Network Management System Using Hierarchical Coloured Petri Nets. In: E. Mosekilde (ed.): Modelling and Simulation 1991. Proceedings of the 1991 European Simulation Multiconference, Copenhagen, 1991, Society for Computer Simulation 1991, 47–52.

    Google Scholar 

  9. S. Christensen, J. Toksvig: Tool Support for Place Flow Analysis of Hierarchical CP-nets. Computer Science Department, Aarhus University, Denmark, Version 2.0.1, 1993.

    Google Scholar 

  10. E.M. Clarke, T. Filkorn, S. Jha: Exploiting Symmetry in Temporal Logic Model Checking. In: C. Courcoubetis (ed.): Computer Aided Verification. Proceedings of the 5th International Conference on Computer Aided Verification, Elounda, Greece, 1993, Lecture Notes in Computer Science Vol. 697, Springer-Verlag 1993, 450–62.

    Google Scholar 

  11. H. Clausen, P.R. Jensen: Validation and Performance Analysis of Network Algorithms by Coloured Petri Nets. In PNPM93: Petri Nets and Performance Models. Proceedings of the 5th International Workshop, Toulouse, France 1993, IEEE Computer Society Press, 280–289.

    Google Scholar 

  12. J.M. Couvreur, J. Martínez: Linear Invariants in Commutative High Level Nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1990, Lecture Notes in Computer Science Vol. 483, Springer-Verlag 1991, 146–165. Also in [30], 284–302.

    Google Scholar 

  13. Design/CPN. Reference Manual. Meta Software Corporation, 125 Cambridge Park Drive, Cambridge MA 02140, USA, Version 2.0, 1993.

    Google Scholar 

  14. Design/CPN Occurrence Graph Analyzer. Meta Software Corporation, 125 Cambridge Park Drive, Cambridge MA 02140, USA, Version 0.35, 1993.

    Google Scholar 

  15. E.A. Emerson, A.P. Sistla: Symmetry and Model Checking. In: C. Courcoubetis (ed.): Computer Aided Verification. Proceedings of the 5th International Conference on Computer Aided Verification, Elounda, Greece, 1993, Lecture Notes in Computer Science Vol. 697, Springer-Verlag 1993, 463–477.

    Google Scholar 

  16. A. Finkel: A Minimal Coverability Graph for Petri Nets. Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris 1990, 1–21.

    Google Scholar 

  17. G. Florin, C. Kaiser, S. Natkin: Petri Net Models of a Distributed Election Protocol on Undirectional Ring. Proceedings of the 10th International Conference on Application and Theory of Petri Nets, Bonn 1989, 154–173.

    Google Scholar 

  18. H.J. Genrich, K. Lautenbach: System Modelling with High-level Petri Nets. Theoretical Computer Science 13 (1981), North-Holland, 109–136.

    Google Scholar 

  19. H.J. Genrich: Predicate/Transition Nets. In: W. Brauer, W. Reisig, 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. Also in [30], 3–43.

    Google Scholar 

  20. H.J. Genrich, R.M. Shapiro: Formal Verification of an Arbiter Cascade. In: K. Jensen (ed.): Application and Theory of Petri Nets 1992. Proceedings of the 13th International Petri Net Conference, Sheffield 1992, Lecture Notes in Computer Science Vol. 616, Springer-Verlag 1992, 205–223.

    Google Scholar 

  21. P. Huber, A.M. Jensen, L.O. Jepsen, K. Jensen: Reachability Trees for High-level Petri Nets. Theoretical Computer Science 45 (1986), North-Holland, 261–292. Also in [30], 319–350.

    Google Scholar 

  22. P. Huber, V.O. Pinci: A Formal Executable Specification of the ISDN Basic Rate Interface. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus 1991, 1–21.

    Google Scholar 

  23. K. Jensen: Coloured Petri Nets and the Invariant Method. Theoretical Computer Science 14 (1981), North-Holland, 317–336.

    Google Scholar 

  24. K. Jensen: High-level Petri Nets. In: A. Pagnoni, G. Rozenberg (eds.): Applications and Theory of Petri Nets, Informatik-Fachberichte Vol. 66, Springer-Verlag 1983, 166–180.

    Google Scholar 

  25. K. Jensen: Coloured Petri Nets. In: W. Brauer, W. Reisig, 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 

  26. 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. 483, Springer-Verlag 1991, 342–416. Also in [30], 44–122.

    Google Scholar 

  27. K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. 1: Basic Concepts. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1992.

    Google Scholar 

  28. K. Jensen: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Vol. 2: Analysis Methods. EATCS Monographs on Theoretical Computer Science, Springer-Verlag. To appear in 1994.

    Google Scholar 

  29. K. Jensen: Coloured Petri Nets with Time Stamps. Computer Science Department, Aarhus University, Denmark, 1993.

    Google Scholar 

  30. K. Jensen, G. Rozenberg (eds.): High-level Petri Nets. Theory and Application. Springer-Verlag, 1991.

    Google Scholar 

  31. R.M. Karp, R.E. Miller: Parallel Program Schemata. Journal of Computer and System Sciences, Vol. 3, 1969, 147–195.

    Google Scholar 

  32. W.W. McLendon, R.F. Vidale: Analysis of an Ada System Using Coloured Petri Nets and Occurrence Graphs. In: K. Jensen (ed.): Application and Theory of Petri Nets 1992. Proceedings of the 13th International Petri Net Conference, Sheffield 1992, Lecture Notes in Computer Science Vol. 616, Springer-Verlag 1992, 384–388.

    Google Scholar 

  33. G. Memmi, J. Vautherin: Analysing Nets by the Invariant Method. In: W. Brauer, W. Reisig, 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, 300–336. Also in [30], 247–283.

    Google Scholar 

  34. R. Milner, R. Harper, M. Tofte: The Definition of Standard ML. MIT Press, 1990.

    Google Scholar 

  35. R. Milner, M. Tofte: Commentary on Standard ML. MIT Press, 1991.

    Google Scholar 

  36. K.H. Mortensen, V. Pinci: Modelling the Work Flow of a Nuclear Waste Management Program. Computer Science Department, Aarhus University, Denmark, 1993.

    Google Scholar 

  37. L. Paulson: ML for the Working Programmer. Cambridge University Press, 1991.

    Google Scholar 

  38. C.A. Petri: Kommunikation mit Automaten. Schriften des IIM Nr. 2, Institut für Instrumentelle Mathematik, Bonn, 1962. English translation: Technical Report RADC-TR-65-377, Griffiths Air Force Base, New York, Vol. 1, Suppl. 1, 1966.

    Google Scholar 

  39. L. Petrucci: Combining Finkel's and Jensen's Reduction Techniques to Build Covering Trees for Coloured Nets. Petri Net Newsletter no. 36 (August 1990), Special Interest Group on Petri Nets and Related System Models, Gesellschaft für Informatik (GI), Germany, 1990, 32–36.

    Google Scholar 

  40. V.O. Pinci, R.M. Shapiro: An Integrated Software Development Methodology Based on Hierarchical Colored Petri Nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1991, Lecture Notes in Computer Science Vol. 524, Springer-Verlag 1991, 227–252. Also in [30], 649–667.

    Google Scholar 

  41. G. Rozenberg: Behaviour of Elementary Net Systems. In: W. Brauer, W. Reisig, 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, 60–94.

    Google Scholar 

  42. R.M. Shapiro: Validation of a VLSI Chip Using Hierarchical Coloured Petri Nets. Journal of Microelectronics and Reliability, Special Issue on Petri Nets, Pergamon Press, 1991. Also in [30], 667–687.

    Google Scholar 

  43. R.M. Shapiro, V.O. Pinci, R. Mameli: Modelling a NORAD Command Post Using SADT and Coloured Petri Nets. Proceedings of the IDEF Users Group, Washington DC, May 1990.

    Google Scholar 

  44. P.S. Thiagarajan: Elementary Net Systems. In: W. Brauer, W. Reisig, 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, 26–59.

    Google Scholar 

  45. A. Valmari: Stubborn Sets for Reduced State Space Generation. In: G. Rozenberg (ed.): Advances in Petri Nets 1990, Lecture Notes in Computer Science Vol. 483, Springer-Verlag 1991, 491–515.

    Google Scholar 

  46. A. Valmari: Stubborn Sets of Coloured Petri Nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Aarhus 1991, 102–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Aarhus University, Ny Munkegade, Bldg. 540, DK-8000, Aarhus C, Denmark

    Kurt Jensen

Authors
  1. Kurt Jensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jensen, K. (1994). An introduction to the theoretical aspects of Coloured Petri Nets. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) A Decade of Concurrency Reflections and Perspectives. REX 1993. Lecture Notes in Computer Science, vol 803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58043-3_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-58043-3_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58043-0

  • Online ISBN: 978-3-540-48423-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation