Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

18117 Isomorphism Checking for Symmetry Reduction
Home Policy Brochure Browse Search User Area Contact Help

Rensink, A. (2010) Isomorphism Checking for Symmetry Reduction. Technical Report TR-CTIT-10-27, Centre for Telematics and Information Technology University of Twente, Enschede. ISSN 1381-3625

Full text available as:


350 Kb
Open Access

Exported to Metis


In this paper, we show how isomorphism checking can be used as an effective technique for symmetry reduction. Reduced state spaces are equivalent to the original ones under a strong notion of bisimilarity which preserves the multiplicity of outgoing transitions, and therefore also preserves stochastic temporal logics. We have implemented this in a setting where states are arbitrary graphs. Since no efficiently computable canonical representation is known for arbitrary graphs modulo isomorphism, we define an isomorphism-predicting hash function on the basis of an existing partition refinement algorithm. As an example, we report a factorial state space reduction on a model of an ad-hoc network connectivity protocol.

Item Type:Internal Report (Technical Report)
Research Group:EWI-FMT: Formal Methods and Tools
Research Program:CTIT-DSN: Dependable Systems and Networks
Research Project:GRAIL: Graphs for the Abstract Interpretation of Languages
ID Code:18117
Deposited On:16 July 2010
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item