In: Proc. 4th Int. Workshop on Petri Nets and Performance Models (PNPM'91), Melbourne, Australia, pages 144-153. IEEE Comp. Soc. Press, December 1991.
Abstract: Well-formed coloured Petri nets (WN) have been recently defined as a new formalism that allows the automatic identification of model symmetries by means of the construction of the symbolic reachability graph (SRG). Here we define a sufficient structural condition for the simplification of the colour structure of the net that can exploit symmetries not detectable with the SRG. The simplified WNs may have reduced SRG and in any case are easier to analyze by means of the SRG technique.
Back to the Petri Nets Bibliography