@techreport{Junttila:A72,
author = {Tommi Junttila},
title = {Symmetry Reduction Algorithms for Data Symmetries},
institution = {Helsinki University of Technology, Laboratory for Theoretical
Computer Science},
month = May,
year = {2002},
type = {Research Report},
number = {A72},
address = {Espoo, Finland},
pages = {49},
keywords = {Symmetry, reachability analysis, Petri nets, the Mur$\varphi$ tool},
abstract = {The core problem in the symmetry reduction method for
state space analysis is to decide whether two states are symmetric
or to produce a symmetric representative state for a state.
This report presents algorithms for the problem under data symmetries.
The setting covers systems described in the Mur$\varphi$ language or
in terms of high-level Petri nets.
The first two algorithms are based on refining ordered partitions by
using symmetry respecting invariants.
The last algorithm exploits existing graph isomorphism algorithms
that are then applied on characteristic graphs of states,
i.e. graphs corresponding to the states in a symmetry respecting way.
Some experimental results are also reported.}
}