New orbit algorithms for data symmetries

State space symmetries can be exploited in model checking of concurrent systems by identifying states that are equivalent under the symmetries. The core problem during the generation of the symmetry reduced state space is to determine whether two states are equivalent, or alternatively, to transform states into equivalent, canonical representatives. This paper introduces new algorithms for these orbit problems under state space symmetries that are produced by symmetric use of data values. Some experimental results comparing the efficiency of the proposed algorithms against the ones in the Murφ tool are provided.