A heuristic for symmetry reductions with scalarsets

D. Bosnacki, D.R. Dams, L. Holenderski

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

12 Citations (Scopus)

Abstract

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 on top of the Spin model checker, and compared their performance on several examples, with encouraging results.
Original languageEnglish
Title of host publicationFME 2001: Formal Methods for Increasing Software Productivity (International Symposium of Formal Methods Europe, Berlin, Germany, March 12-16, 2001, Proceedings)
EditorsJ. Nuno Oliveira, P. Zave
Place of PublicationBerlin
PublisherSpringer
Pages518-533
ISBN (Print)978-3-540-41791-0
DOIs
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
Volume2021
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'A heuristic for symmetry reductions with scalarsets'. Together they form a unique fingerprint.

Cite this