Abstract
We present four versions of a new heuristic for coping with the problem of finding (canonical) representatives of symmetry equiva-lence 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 on top of the Spin model checker, and compared their performance on several examples, with encouraging results. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Bošnački, D., Dams, D., & Holenderski, L. (2001). A heuristic for symmetry reductions with scalarsets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2021 LNCS, pp. 518–533). Springer Verlag. https://doi.org/10.1007/3-540-45251-6_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
