Automatic Symmetry Detection for Model Checking Using Computational Group Theory

@inproceedings{Donaldson2005AutomaticSD,
  title={Automatic Symmetry Detection for Model Checking Using Computational Group Theory},
  author={Alastair F. Donaldson and Alice Miller},
  booktitle={FM},
  year={2005}
}
We present an automatic technique for the detection of structural symmetry in a model directly from its Promela specification. Our approach involves finding the static channel diagram of the model, a graphical representation of channel-based system communication; computing the group of symmetries of this diagram; and computing the largest possible subgroup of these symmetries which induce automorphisms of the underlying model. We describe a tool, SymmExtractor, which, for a given model and LTL… 
View via Publisher
eprints.gla.ac.uk
45 Citations
Highly Influential Citations
1
Background Citations
15
Methods Citations
15
Results Citations
1

45 Citations

Automatic techniques for detecting and exploiting symmetry in model checking
TLDR
A theoretical framework for symmetry reduction which can be applied to explicit state model checking is presented, and it is shown that the framework can be feasibly implemented as part of a system which is widely used in both industry and academia.
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
TLDR
This work presents a framework for symmetry reduction with an arbitrary group of structural symmetries, and describes a symmetry reduction package for the SPIN model checker which interfaces with the computational algebra system GAP.
Constraint-based automatic symmetry detection
TLDR
This work shows how a concurrent model can be viewed as a constraint satisfaction problem (CSP), and presents an algorithm capable of detecting symmetries arising from the CSP which induce automorphisms of the model.
Regular Symmetry Patterns (Technical Report)
TLDR
A symbolic framework for capturing symmetry patterns in parameterised systems (i.e. an infinite family of finite-state systems) that automatically synthesises a safety-preserving finite approximant, which can then be verified for safety solely using a finite- state model checker.
A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker
TLDR
TopSPIN is presented, a fully automatic symmetry reduction package for the SPIN model checker that uses the GAP computational algebra system to effectively detect state space symmetry from the associated Promela specification.
Symmetry reduction methods for model checking
TLDR
A variety of model checkers are introduced and an introduction to symmetry reduction methods, and their implementations are given.
Regular Symmetry Patterns
TLDR
This work proposes a symbolic framework for capturing symmetry patterns in parameterised systems i.e. an infinite family of finite-state systems: two regular word transducers to represent, respectively, parametersised systems and symmetry patterns.
Vector Symmetry Reduction
  • A. Donaldson
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2009
Symmetry Reduction and Compositional Verification on Timed Automata
TLDR
A technique that incorporates automatic symmetry detection and symmetry reduction in the analysis of systems modeled by timed automata is described, and it is shown that verification is decidable in time polynomial in the state space of the cut-off instance.
Probabilistic symmetry reduction
TLDR
This thesis defines new techniques to exploit the identified symmetry and provide efficient generation of the quotient model and proves the correctness of the approach, and demonstrates its viability by implementing a tool to apply symmetry reduction to an explicit state model checker.
...
...

References

SHOWING 1-10 OF 18 REFERENCES
Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis
Symmetry Reductions in Model-Checking
TLDR
The talk will present three different methods, based on symmetry reductions, in containing the state explosion problem in model checking, an on-the-fly model checker that employs symmetry reductions and checks for correctness under a variety of fairness conditions.
Symmetry Reductions in Model Checking
TLDR
It is proved that the orbit problem is equivalent to an important problem in computational group theory which is at least as hard as the graph isomorphism but not known to be NP-complete.
Better verification through symmetry
TLDR
This work provides a proof of the soundness of the new symmetry-based verification algorithm based on a definition of the formal semantics of a simple description language with scalarsets, and leads to an alternative characterization of data independence.
Model Checking
TLDR
Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.
Exploiting structure in symmetry detection for CNF
TLDR
A new symmetry-detection tool is presented, SAUCY, which outperforms NAUTY by several orders of magnitude on the large, structured CNF formulas generated from typical EDA problems.
Model checking and abstraction
TLDR
A method for using abstraction to reduce the complexity of temporal logic model checking by constructing an abstract model of a program without ever examining the corresponding unabstracted model is described.
Model checking systems of replicated processes with spin
TLDR
A reduction technique which is very useful against the state explosion problem which occurs when model checking distributed system with several instances of the same process, using symmetry which appears in the system.
Generalising Feature Interactions in Email
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall's email model presented at FIW'00, but the implementation is at a…
Solving difficult SAT instances in the presence of symmetry
TLDR
This work articulates SAT instances that are unusually difficult for their size, including satisfiable instances derived from routing problems, using an efficient implementation to solve the graph automorphism problem and shows that in structured SAT instances difficulty may be associated with large numbers of symmetries.
...
...