Automatic symmetry detection for model checking using computational group theory

Donaldson, A.F. and Miller, A. (2005) Automatic symmetry detection for model checking using computational group theory. Lecture Notes in Computer Science, 3582, pp. 481-496. (doi: 10.1007/11526841_32)



Publisher's URL:


We present an automatic technique for the detection of structural symmetry in a model directly from its Promela specification. Our approach involves finding the <i>static</i> <i>channel</i> <i>diagram</i> 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 <i>LTL</i> property, uses our approach to find a group of symmetries of the model which preserve the property. This group can then be used for symmetry reduction during model checking using existing quotient-based methods. Unlike previous approaches, our method can detect arbitrary structural symmetries arising from the communication structure of the model.

Item Type:Articles
Keywords:Promela/Spin, symmetry reduction, model checking, communicating processes, distributed systems, formal modelling, Gap, concurrency.
Glasgow Author(s) Enlighten ID:Miller, Professor Alice
Authors: Donaldson, A.F., and Miller, A.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Copyright Holders:Copyright © 2005 Springer
First Published:First published in Lecture Notes in Computer Science 3582:481-496
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record