A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker
نویسندگان
چکیده
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.
منابع مشابه
Exact and Approximate Strategies for Symmetry Reduction in Model Checking
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 fr...
متن کاملVector Symmetry Reduction
Symmetry reduction is an effective state-space reduction technique for model checking, and works by restricting search to equivalence class representatives with respect to a group of symmetries for a model. A major problem with symmetry reduction techniques is the time taken to compute the representative of a state, which can be prohibitive. In efficient implementations of symmetry reduction, a...
متن کاملExtending Symmetry Reduction Techniques to a Realistic Model of Computation
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be represented by an integer, and where components do not hold references to one another. Symmetry reduction techniques for model checking usually require a solution to the NP-hard Constructive Orbit Problem (COP)–computing the...
متن کاملA Heuristic for Symmetry Reductions with Scalarsets
We present four versions of a new heuristic for coping with the problem of finding (canonical) representatives of symmetry equivalence classes (the so-called orbit problem), in symmetry techniques for model checking. The practical implementation of such techniques hinges on appropriate workarounds of this hard problem, which is equivalent to graph isomorphism. We implemented the four strategies...
متن کاملSpin-to-Grape: A Tool for Analysing Symmetry in Promela Models
We provide two examples of Promela models of concurrent, distributed systems, whose associated Kripke structures have more complex symmetry groups than those of models commonly cited in the literature. We present a tool, SPIN-to-GRAPE, which allows the state-graph of a Promela model to be manipulated using the group-theoretic package GAP and its graph-theoretic add on, GRAPE. Through studying t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006