EEMCS EPrints Service
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:
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.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item