Donaldson, A.F. and Miller, A. (2008) Automatic symmetry detection for Promela. Journal of Automated Reasoning, 41(3-4), pp. 251-293. (doi: 10.1007/s10817-008-9107-4)
Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1007/s10817-008-9107-4
Abstract
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela, has a formally defined semantics. We show how we can detect symmetry in specifications defined in Promela-lite by constructing a directed, coloured bipartite digraph called a static channel diagram, and applying computational group theoretic techniques. We extend our approach to Promela and introduce a tool, SymmExtractor, for automatically detecting symmetries of Promela specifications. We demonstrate the effectiveness of our approach via experimental results for a suite of Promela specifications. Unlike previous approaches our technique is fully automatic, and not restricted to fully symmetric systems.
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: | Journal of Automated Reasoning |
ISSN: | 0168-7433 |
ISSN (Online): | 1573-0670 |
Published Online: | 03 December 2008 |
University Staff: Request a correction | Enlighten Editors: Update this record