Coloured Petri Nets

Coloured Petri nets (CPN) is a formalism which extends ordinary Petri nets by adding data types and modularity. This means that is possible to make succinct, readable and structured models. The CPN models may be investigated by means of simulation. However, the models may also be validated by a number of mathematical analysis techniques, such as state graphs and invariants. The modelling, simulation and analysis by means of CPN are supported by a set of commercially available computer tools called Design/CPN. CPN models have been used in a large range of different application areas, some of which are listed. Design/CPN uses the functional programming language Standard ML to specify data types, functions and data manipulations. 12 properties of CPN are presented. >

[1]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

[2]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[3]  Robert M. Shapiro,et al.  An integrated software development methodology based on hierarchical colored Petri Nets , 1990, Applications and Theory of Petri Nets.

[4]  Marco Ajmone Marsan,et al.  Application and Theory of Petri Nets 1993 , 1993, Lecture Notes in Computer Science.

[5]  Kurt Jensen.  Coloured Petri nets: A high level language for system design and analysis , 1989, Applications and Theory of Petri Nets.

[6]  Robert M. Shapiro.  Validation of a VLSI chip using hierarchical colored Petri nets , 1991 .

[7]  Kurt Jensen,et al.  An Introduction to the Theoretical Aspects of Coloured Petri Nets , 1993, REX School/Symposium.

[8]  Henning Clausen,et al.  Validation and performance analysis of network algorithms by coloured Petri nets , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[9]  Ludmila Cherkasova,et al.  On scalable net modeling of OLTP , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[10]  S. C. Bruell,et al.  An Example of Modeling and Evaluation of a Concurrent Program Using Colored Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm , 1992, IEEE Trans. Parallel Distributed Syst..

[11]  David,et al.  Application and Theory of Petri Nets 1994 , 1994, Lecture Notes in Computer Science.

[12]  Kurt Jensen,et al.  Application and Theory of Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[13]  Peter M. A. Sloot,et al.  Modelling and Simulation , 1988, Systems Analysis and Simulation 1988, I: Theory and Foundations. Proceedings of the International Symposium held in Berlin (GDR), September 12–16, 1988.