In: LNCS 2244: Perspectives of System Informatics, pages 268-pp. 4th International Andrei Ershov Memorial Conference, PSI 2001, Akademgorodok, Novosibirsk, Russia, July 2-6, 2001. Revised Papers / D. Bjørner, M. Broy, A. Zamulin (eds.) --- Springer Verlag, December 2001.
Abstract: In this paper the unfolding technique is applied to coloured Petri nets (CPN). The technique is formally described, the definition of a branching process of CPN is given. The existence of the maximal branching process and the important properties of CPN's unfoldings are proven. A new approach consisting in combining unfolding technique with symmetry and equivalence specifications is presented and the important properties of obtained unfoldings are proven. We require CPN to be finite, n-safe and containing only finite sets of colours.