<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>8172</REFNUM><AUTHORS><AUTHOR>Donaldson,A.F.</AUTHOR><AUTHOR>Miller,A.</AUTHOR></AUTHORS><YEAR>2006</YEAR><TITLE>Exact and Approximate Strategies for Symmetry Reduction in Model Checking</TITLE><PLACE_PUBLISHED>Proceedings of the 14th International Symposium on Formal Methods (FM'06), volume 4085 of Lecture Notes in Computer Science.</PLACE_PUBLISHED><PUBLISHER>Springer</PUBLISHER><PAGES>541-556</PAGES><LABEL>Donaldson:2006:8172</LABEL><KEYWORDS><KEYWORD>symmetry reduction</KEYWORD></KEYWORDS<ABSTRACT>Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states during search. Consequently, existing symmetry reduction packages can only exploit full symmetry between system components, as checking the equivalence of states is straightforward in this special case. We present a framework for symmetry reduction with an arbitrary group of structural symmetries. By generalising existing techniques for efficiently exploiting symmetry, and introducing an approximate strategy for use with groups for which fast, exact strategies are not available, our approach allows for significant state-space reduction with minimal time overhead. We show how computational group theoretic techniques can be used to analyse the structure of a symmetry group so that an appropriate symmetry reduction strategy can be chosen, and we describe a symmetry reduction package for the spin model checker which interfaces with the computational algebra system gap. Experimental results on a variety of Promela models illustrate the effectiveness of our methods.</ABSTRACT></RECORD></RECORDS></XML>