In: Proceeding of the 16th International Conference on Application and Theory of Petri Nets, Turin, June 1995., pages 238-257. 1995.
Abstract: The construction of symbolic reachability graphs is a useful technique for reducing state explosion in High-level Petri nets. Such a reduction has been obtained by exploiting the symmetries of the whole net. In this paper, we extend this method to deal with partial symmetries. In a first time, we introduce an example which shows the interest and the principles of our method. Then we develop the general algorithm. Lastly we enumerate the properties of this Extended Symbolic Reachability Graph, including the reachability equivalence.