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.

[1]  Antti Valmari,et al.  Compositional State Space Generation , 1991, Applications and Theory of Petri Nets.

[2]  Peter Huber,et al.  Hierarchies in coloured Petri nets , 1991, Applications and Theory of Petri Nets.

[3]  Giancarlo Mauri,et al.  OBJSA Nets: a Class of High- level Nets Having Objects as Domains , 1987, European Workshop on Applications and Theory of Petri Nets.

[4]  Søren Christensen,et al.  Coloured Petri Nets Extended with Channels for Synchronous Communication , 1992 .

[5]  Søren Christensen,et al.  Modelling and Simulation of a Network Management System using Hierarchical Coloured Petri Nets: Extended version , 1994 .

[6]  Y. Narahari,et al.  On the invariants of coloured Petri nets , 1985, Applications and Theory in Petri Nets.

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

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

[9]  Kurt Jensen,et al.  Coloured Petri nets: A high level language for system design and analysis , 1991, Applications and Theory of Petri Nets.

[10]  Laure Petrucci,et al.  Semantics, composition and net properties of algebraic high-level nets , 1990, Applications and Theory of Petri Nets.

[11]  Kurt Jensen,et al.  Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

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

[13]  Laure Petrucci,et al.  Avoiding State Exposion by Composition of Minimal Covering Graphs , 1991, CAV.

[14]  Ghassan Chehaibar Use of reentrant nets in modular analysis of colored nets , 1990, Applications and Theory of Petri Nets.

[15]  Wolfgang Reisig,et al.  Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..