A computational group theoretic symmetry reduction package for the SPIN model checker

Donaldson, A.F. and Miller, A. (2006) A computational group theoretic symmetry reduction package for the SPIN model checker. Lecture Notes in Computer Science, 4019, pp. 374-380. (doi:10.1007/11784180)

[img]
Preview
Text
donaldson_miller_amast2006.pdf

178kB

Publisher's URL: http://dx.doi.org/10.1007/11784180

Abstract

Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence of states during search. We present TopSpin, a fully automatic symmetry reduction package for the Spin model checker. TopSpin uses the Gap computational algebra system to effectively detect state space symmetry from the associated Promela specification, and to choose an efficient symmetry reduction strategy by classifying automorphism groups as a disjoint/wreath product of subgroups. We present encouraging experimental results for a variety of Promela examples.

Item Type:Articles
Status:Published
Refereed:Yes
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
Publisher:Springer
ISSN:0302-9743
Copyright Holders:Copyright © 2006 Springer
First Published:First published in Lecture Notes in Computer Science 4019:374-380
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

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