Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >

/pdf/petri-nets-properties-analysis-and-applications-43jwyjdxr0.pdf

Petri nets: Properties, analysis and applications

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. >

https://ieeexplore.ieee.org/iel3/1386/6485/00255880.pdf

Coloured Petri nets

This paper describes how Coloured Petri Nets (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).

Coloured Petri Nets: a high level language for system design and analysis

This paper describes a Petri net model, called Coloured Petri nets (CP-nets), where information is attached to each token. The information can be inspected and modified when a transition fires. For most applications, this generalization of ordinary Petri nets allows the user to make more manageable descriptions, due to the fact that equal subnets can be folded into each other, yielding a much smaller net. The paper investigates how to analyse Coloured Petri nets. It turns out that place-invariants and reachability trees, two of the most important methods for ordinary Petri nets, can be generalized to apply for Coloured Petri nets.

Coloured Petri Nets

Coloured Petri nets (CP-nets or CPNs) provide a framework for the design, specification, validation, and verification of systems. CP-nets have a wide range of application areas and many CPN projects have been carried out in industry, e.g., in the areas of communication protocols, operating systems, hardware designs, embedded systems, software system designs, and business process re-engineering. Design/CPN is a graphical computer tool supporting the practical use of CP-nets. The tool supports the construction, simulation, and functional and performance analysis of CPN models. The tool is used by more than four hundred organisations in forty different countries – including one hundred commercial companies. It is available free of charge, also for commercial use. This paper provides a comprehensive road map to the practical use of CP-nets and the Design/CPN tool. We give an informal introduction to the basic concepts and ideas underlying CP-nets. The key components and facilities of the Design/CPN tool are presented and their use illustrated. The paper is self-contained and does not assume any prior knowledge of Petri nets and CP-nets nor any experience with the Design/CPN tool.

/pdf/the-practitioner-s-guide-to-coloured-petri-nets-22x5f3z251.pdf

Li

Papers

Reachability trees for high-level petri nets