A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker

Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence of states during search. We present TopSPIN, a fully automatic symmetry reduction package for the SPIN model checker. TopSPIN uses the GAP computational algebra system to effectively detect state space symmetry from the associated Promela specification, and to choose an efficient symmetry reduction strategy by classifying automorphism groups as a disjoint/wreath product of subgroups. We present encouraging experimental results for a variety of Promela examples.

[1]  Alastair F. Donaldson,et al.  Automatic Symmetry Detection for Model Checking Using Computational Group Theory , 2005, FM.

[2]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

[3]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[4]  A. Prasad Sistla.  Symmetry Reductions in Model-Checking , 2003, VMCAI.

[5]  Gregory Butler,et al.  Fundamental Algorithms for Permutation Groups , 1991, Lecture Notes in Computer Science.

[6]  Igor L. Markov,et al.  Exploiting structure in symmetry detection for CNF , 2004, Proceedings. 41st Design Automation Conference, 2004..

[7]  E. Allen Emerson,et al.  Virtual symmetry reduction , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[8]  Thomas Wahl,et al.  Dynamic Symmetry Reduction , 2005, TACAS.

[9]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[10]  Dragan Bosnacki,et al.  Symmetric Spin , 2000, SPIN.

[11]  Dragan Bosnacki.  A Light-Weight Algorithm for Model Checking with Symmetry Reduction and Weak Fairness , 2003, SPIN.