Abstract
Symmetry reduction is a technique to counter state explosion for systems with regular structure. It relies on idealistic assumptions about indistinguishable components, which in practice may only be similar. In this article, we present a flexible, lazy approach to symmetry-reducing a structure without any prior knowledge about its global symmetry. Instead of a-priori checking for compliance with symmetry conditions, each encountered state is annotated on the fly with information about how symmetry is violated along the path leading to it. The method naturally favors “very symmetric” systems: more similarity among the components leads to greater compression. A notion of subsumption is used to prune the annotated search space during exploration. Previous solutions to the approximate symmetry reduction problem are restricted to specific types of asymmetry, such as up to bisimilarity, or incur a large overhead, either during preprocessing of the structure or during the verification run. In contrast, the strength of our method is its balance between ease of implementation and algorithmic flexibility. We include analytic and experimental results that witness its efficiency.
Similar content being viewed by others
References
Anand S, Pasareanu C, Visser W (2006) Symbolic execution with abstract subsumption checking. In: Model checking of software (SPIN)
Canfield R (1998) The size of the largest antichain in the partition lattice. J Comb Theory Ser A 83(2): 188–201
Clarke E, Enders R, Filkorn T, Jha S (1996) Exploiting symmetry in temporal logic model checking. Formal Methods Syst Des (FMSD) 9(1–2): 77–104
Donaldson A, Miller A (2005) Automatic symmetry detection for model checking using computational group theory. In: Formal methods (FM)
Donaldson A, Miller A (2006) Exact and approximate strategies for symmetry reduction in model checking. In: Formal methods (FM)
Emerson A, Havlicek J, Trefler R (2000) Virtual symmetry reduction. In: Logic in computer science (LICS)
Emerson A, Sistla P (1996) Symmetry and model checking. Formal Methods Syst Des (FMSD) 9(1–2): 105–131
Emerson A, Trefler R (1999) From asymmetry to full symmetry: new techniques for symmetry reduction in model checking. In: Correct hardware design and verification methods (CHARME)
Emerson A, Wahl T (2003) On combining symmetry reduction and symbolic representation for efficient model checking. In: Correct hardware design and verification methods (CHARME)
Hendriks M, Behrmann G, Larsen KG, Niebert P, Vaandrager F (2003) Adding symmetry reduction to Uppaal. In: Formal modelling and analysis of timed systems (FORMATS)
Henzinger T, Jhala R, Majumdar R, Sutre G (2002) Lazy abstraction. In: Principles of programming languages (POPL)
Holzmann G (1997) The model checker spin. Trans Softw Eng (TOSE) 23(5): 279–295
Ip N, Dill D (1999) Verifying systems with replicated components in Murϕ. Formal Methods Syst Des (FMSD) 14(3): 273–310
Sistla P, Godefroid P (2004) Symmetry and reduced symmetry in model checking. Trans Program Lang Syst (TOPLAS) 26(4): 702–734
Somenzi F (2001) The CU decision diagram package, release 2.3.1. University of Colorado at Boulder. http://vlsi.colorado.edu/~fabio/CUDD/
Wahl T (2007) Adaptive symmetry reduction. In: Computer-aided verification (CAV)
Author information
Authors and Affiliations
Corresponding author
Additional information
J.C.P. Woodcock
A preliminary version of this article appeared in [Wah07]. The work was supported by the EPSRC, grant number EP/G026254/1, and by a Microsoft European PhD Fellowship.
Rights and permissions
About this article
Cite this article
Wahl, T., D’Silva, V. A lazy approach to symmetry reduction. Form Asp Comp 22, 713–733 (2010). https://doi.org/10.1007/s00165-009-0131-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-009-0131-x