Efficient state-based analysis by introducing bags in Petri nets color domains

The use of high-level nets, such as coloured Petri nets, is very convenient for modelling complex controllable system in order to have a compact, readable and structured specification. However, when coming to the analysis phase, using too elaboratc types becomes a burden.

[1]  Giovanni Chiola,et al.  A Symbolic Reachability Graph for Coloured Petri Nets , 1997, Theor. Comput. Sci..

[2]  Fabrice Kordon,et al.  New features in CPN-AMI 3: focusing on the analysis of complex distributed systems , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[3]  Giovanni Chiola,et al.  On Well-Formed Coloured Nets and Their Symbolic Reachability Graph , 1991 .

[4]  Tommi A. Junttila,et al.  On the symmetry reduction method for Petri nets and similar formalisms , 2003 .

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

[6]  Hartmut Klauck,et al.  Algorithms for Parity Games , 2001, Automata, Logics, and Infinite Games.

[7]  Wendy E. Mackay,et al.  CPN/Tools: A Tool for Editing and Simulating Coloured Petri Nets ETAPS Tool Demonstration Related to TACAS , 2001, TACAS.

[8]  Lars Michael Kristensen,et al.  Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems , 2007, International Journal on Software Tools for Technology Transfer.

[9]  Fabrice Kordon,et al.  An Approach to Model Variations of a Scenario: Application to Intelligent Transport Systems , 2006 .

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

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

[12]  Fabrice Kordon,et al.  A survey: applying formal methods to a software intensive system , 2001, Proceedings Sixth IEEE International Symposium on High Assurance Systems Engineering. Special Topic: Impact of Networking.

[13]  Souheib Baarir,et al.  On the use of exact lumpability in partially symmetrical well-formed nets , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[14]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[15]  E. Allen Emerson,et al.  From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking , 1999, CHARME.

[16]  Fabrice Kordon,et al.  PN Standardisation: A Survey , 2006, FORTE.

[17]  Karsten Schmidt,et al.  How to calculate symmetries of Petri nets , 2000 .

[18]  Giovanni Chiola,et al.  Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications , 1993, IEEE Trans. Computers.

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