Analysis Of Coloured Petri Nets Research Articles

Colored Petri Net inversion for Backward Reachability Analysis

Colored Petri Nets (CPN) are a powerful, recognized and intuitive modelling tool. They allow a precise representation of distributed, embedded and/or real time systems. These models can be then used among others for the dependability assessment. This paper develops a new method of CPN analysis called the Backward reachability. It provides information about different ways of reaching a particular CPN marking that represents, for example, a failure state or a transilient fault. This analysis is performed on an inverse CPN which is obtained by transforming original CPN structure while preserving the model proprieties. The work develops mathematical tools to prove the pertinence of transformations allowing the definition of inverse CPN. The main advantage of this method is that it allows to determine the sequence leading from the initial to the final marking for any possible final marking vector.

State Space Methods for Coloured Petri Nets

State Space Methods for Coloured Petri Nets

Design/CPN - A Computer Tool for Coloured Petri Nets

In this paper, we describe the computer tool Design/CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have been invested in the development of Design/CPN. It is used world-wide by more than 200 companies and research institutions. For the presentation, we draw from the experiences gained in recent industrial application using Coloured Petri Nets in the design, validation, and verification of communication protocols for audio/video systems.

Towards a Modular Analysis of Coloured Petri Nets

The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to create compact representations of data and action, the size of models has been increasing. A large model can make it difficult to handle the complexity of the modelling as well as the analysis of the total model. It is well-known that the use of a modular approach to modelling has a lot of advantages. A modular approach allows the modeller to consider different parts of the system independently of one another and also to reuse the same module in different systems. A modular approach to analysis is also attractive. It often dramatically decreases the complexity of the analysis task. In this paper, we present modular CP-nets. They are not intended to be used for practical modelling purposes, but they constitute a formal and general framework for discussing different ways of composing individual CP-nets called modules. Modular CP-nets allow us to study composition without restricting the structure of the individual modules. Modular CP-nets are quite simple and do not include syntactical sugar which is convenient and often necessary when modelling in practice. Instead, they have only a few but very general composition constructs. The main result of the paper is the possibility of composing analysis results of the individual modules, in order to obtain results which are valid for the entire modular CP-net. For this purpose, we introduce place invariants at the level of modular CP-nets and we show how such place invariants can be obtained from those of the individual modules. The reader of this paper is assumed to be familiar with the basic definitions of CP-nets and the concept of place invariants. But it is not necessary to be familiar with hierarchical CP-nets.