Exploiting partial symmetries in well-formed nets for the reachability and the linear time model checking problems

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 37, Issue 18, 2004, Pages 219-224

  Baarir, Soheib ^b   Haddad, Serge ^a   Ilié, Jean Michel ^b  

^a Centre National de la Recherche Scientifique   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Coloured petri net; Partial symmetry; Symbolic reachability graph; Well formed petri net

Indexed keywords

DISCRETE EVENT SIMULATION; GRAPH ALGORITHMS; PETRI NETS;

COLOURED PETRI NETS; EXTENDED SYMBOLIC REACHABILITY GRAPHS; LINEAR TIME FORMULAS; LINEAR-TIME MODEL-CHECKING; REACHABILITY PROBLEM; SYMBOLIC REACHABILITY; SYNCHRONIZED PRODUCT; VERIFICATION PROCESS;

MODEL CHECKING;

EID: 84928643894     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/S1474-6670(17)30749-8     Document Type: Conference Paper

References (9)

1. Ajami, K., S. Haddad and J.-M. Hie (1998). Exploiting Symmetry in Linear Temporal Model Checking: one Step Beyond. In: Proc. of Tools and Algorithms for the Construction and Analysis of Systems TACAS'98, part of Theory and practice of Software ETAPS'98. Vol. 1384 of LNCS. Springer Verlag. Lisbon - Portugal, pp. 52-67.
2. Chiola, G. and R. Gaeta (1995). Efficient Simulation of Parallel Architectures Exploiting Symmetric Well-formed Petri Net Models. In: Sixth International Workshop on Petri nets and Performance Models. IEEE Computer Society Press. Durham, NC, USA.
3. Chiola, G.. C. Dutheillet. G. Franceschinis and S. Haddad (1993). Stochastic well-formed coloured nets for symmetric modelling applications. IEEE Transactions on Computers 42(11), 1343-1360.
4. Clarke, E.M., R. Enders, T. Filkorn and S. Jha (1996). Exploiting Symmetry in Temporal Logic Model Chacking. Formal Methods and System Design 9, 77-104.
5. Emerson, E. A. and R. J. Trefler (1999). From Asymmetry to Full Symmetry: New Techniques For Symmetry Reduction in Model Checking. In: Proc of CHARME099. Lecture Notes in Computer Science. Springer Verlag. Bad Herrenalb - Germany, pp. 142-156.
6. Emerson, E.A. and A. Prasad Sistla (1996). Symmetry and Model Checking. Formal Methods and System Design 9, 307-309.
7. Haddad, S.,J.M. Ilie and K. Ajami (2000). A model checking method for partially symmetric systems. In: Proceedings of FOR TE/PS TV'00. Kluwer Academic Publishers. Pisa. Italy, pp. 121-136.
8. Haddad, S.. J.M. Ilie, M. Taghelit and B. Zouan (1995). Symbolic Reachability Graph and Partial Symmetries. In: Proc. of the 16th Intern. Conference on Application and Theory of Petri Nets. Vol. 935 of LNCS. Springer Verlag. Turin, Italy, pp. 238-257.
9. Ilie, J.-M. and K. Ajami (1997). Model Checking through Symbolic Reachability Graph. In: Proc. of Theory and Practice of Software Development TAPSOFT:97 - part of 7th CAAP. Vol. 1214 of LNCS. Springer Verlag. Lille - France, pp. 213-224.