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]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[2]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[3]  Peter Huber,et al.  Reachability Trees for High-level Petri Nets , 1986, Theor. Comput. Sci..

[4]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[5]  Gérard Roucairol,et al.  Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.

[6]  Kurt Jensen.  How to Find Invariants for Coloured Petri Nets , 1981, MFCS.

[7]  Kurt Jensen.  High-Level Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[8]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[9]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[10]  Wolfgang Reisig,et al.  Petri Nets with Individual Tokens , 1982, Theor. Comput. Sci..