In: Burkhard, H.-D.; Czaja, L.; Skowron, A.; Starke, P.: Report No. 140: Proceedings of the workhop on Concurrency, Specification and Programming, Oct 9-11, 2000, pages 285-297. Berlin: Humboldt-University, 2000.
Abstract: Symmetries provide a possibility to overcome the state explosion problem by constructing symmetrically reduced reachability graphs. In this paper we present the basic definitions and prove that the following properties can be verified in this way: reachability, deadlock-freedom, resetability, existence of dead transitions and collective liveness.