Abstract
In this paper the unfolding technique is applied to coloured Petri nets (CPN) [6,7]. 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 [7] 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. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Kozura, V. E. (2001). Unfoldings of coloured petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2244 LNCS, pp. 268–278). Springer Verlag. https://doi.org/10.1007/3-540-45575-2_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
