A heuristic for symmetry reductions with scalarsets

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

12 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelFME 2001: Formal Methods for Increasing Software Productivity (International Symposium of Formal Methods Europe, Berlin, Germany, March 12-16, 2001, Proceedings)
RedacteurenJ. Nuno Oliveira, P. Zave
Plaats van productieBerlin
UitgeverijSpringer
Pagina's518-533
ISBN van geprinte versie978-3-540-41791-0
DOI's
StatusGepubliceerd - 2001

Publicatie series

NaamLecture Notes in Computer Science
Volume2021
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'A heuristic for symmetry reductions with scalarsets'. Samen vormen ze een unieke vingerafdruk.

Citeer dit