<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>7711</REFNUM><AUTHORS><AUTHOR>Donaldson,A.F.</AUTHOR><AUTHOR>Miller,A.</AUTHOR><AUTHOR>Calder,M.</AUTHOR></AUTHORS><YEAR>2005</YEAR><TITLE>Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis</TITLE><PLACE_PUBLISHED>Electronic Notes in Theoretical Computer Science, volume 128/6 </PLACE_PUBLISHED><PUBLISHER>Elsevier Science</PUBLISHER><PAGES>161-177</PAGES><LABEL>Donaldson:2005:7711</LABEL><KEYWORDS><KEYWORD>Model checking</KEYWORD></KEYWORDS<ABSTRACT>Over the last decade there has been much interest in exploiting symmetry to combat the state explosion problem in model checking. Although symmetry in a model often arises as a result of symmetry in the topology of the system being modelled, most model checkers which exploit structurual symmetry are limited to topologies which exhibit total symmetries, such as stars and cliques. We define the static channel diagram of a concurrent, message passing program, and show that under certain restrictions there is a correspondence beteen symmetries of the static channel diagram of a program and symmetries of the Kripke structure associated with the program. This allows the detection, and potential exploitation, of structural symmetry in systems with arbitrary topologies. Our method of symmetry detection can handle mobile systems where channel references are passed on channels, resulting in a dynamic communication structure. We illustrate our results with an example using the Promela modelling language. </ABSTRACT></RECORD></RECORDS></XML>