Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

@inproceedings{Appold2010EfficientSR,
  title={Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking},
  author={Christian Appold},
  booktitle={GANDALF},
  year={2010}
}
One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation. Dynamic symmetry reduction calculates representatives of equivalence classes of states dynamically and thus avoids the construction of the orbit relation. In this paper, we present a new efficient model checking algorithm based… 

Figures and Tables from this paper

Towards Autonomous Robotic Systems

A novel implementation of symmetry reduction, in the form of encoding navigation algorithms relatively with respect to a reference, based on the symmetrical properties of swarms in grids, is proposed, allowing model checking larger grid sizes and number of robots, and consequently, verifying more complex emergent behaviours.

BSP Algorithms for LTL & CTL* Model Checking of Security Protocols. (Algorithmes BSP pour la vérification de modèles LTL et CTL* pour les protocoles de sécurité)

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and

Symmetry Reduction Enables Model Checking of More Complex Emergent Behaviours of Swarm Navigation Algorithms

A novel implementation of symmetry reduction, in the form of encoding navigation algorithms relatively with respect to a reference, exploiting the symmetrical properties of swarms in grids, is proposed.

References

SHOWING 1-10 OF 36 REFERENCES

Dynamic Symmetry Reduction

This paper proposes a more efficient method that determines representatives dynamically during fixpoint iterations that preserves the uniqueness of representatives and applies also to systems with less than full symmetry, and to systems where a translation into counters is not feasible.

On Combining Symmetry Reduction and Symbolic Representation for Efficient Model Checking

This work investigates the use of generic representatives as a means of overcoming the problem of overcoming redundancy inherent in the regular organization of fully symmetric systems: instead of first representing the system as a BDD and then applying symmetry reduction, it translates the given program text into a symmetry-reduced version.

Exploiting symmetry in temporal logic model checking

What it means for a finite state system to be symmetric is formalized and techniques for reducing such systems when the transition relation is given explicitly in terms of states or symbolically as a BDD are described.

From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking

It is shown that for some nearly symmetric systems it is possible to perform symmetry reduction and obtain a bisimilar (up to permutation) symmetry reduced system.

SMC: a symmetry-based model checker for verification of safety and liveness properties

The article presents the SMC system, which works in an on-the-fly manner; it constructs the reduced state graph as and when it is needed, and facilitates early termination, speeds up model checking, and reduces memory requirements.

Better verification through symmetry

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.

Symmetry in temporal logic model checking

The use of symmetry reduction to increase the efficiency of model checking has inspired a wealth of activity in the area of model Checking research, and a survey of the associated literature is provided.

SVISS: Symbolic Verification of Symmetric Systems

SVISS is a flexible platform for incorporating efficient symmetry reduction into symbolic model checking and is believed to be the first symbolic tool to exploit symmetry in concurrent device-driver verification, which is vital in operating system design.

On-the-Fly Model Checking Under Fairness that Exploits Symmetry

An on-the-fly algorithm for model checking under fairness is presented and experimental results demonstrating dramatic reductions in both the running time and memory usage are presented.

Symmetry and model checking

We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In