In: Proceedings of the 10th International Conference on Application and Theory of Petri Nets, 1989, Bonn, Germany, pages 192-209. 1989.
Also in: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 483; Advances in Petri Nets 1990, pages 313-341. Berlin, Germany: Springer-Verlag, 1991.
Abstract: The paper shows how to extend coloured Petri nets (CP-nets) with a hierarchy concept. The paper proposes five different hierarchy constructs (substitution transitions, substitution places, invocation transitions, place fusion, transition fusion), which allow to structure large CP-nets as a set of interrelated subnets. The paper discusses the properties of the proposed hierarchy constructs, and it illustrates them by means of two examples (telephone system and multi-token ring protocol). All of the hierarchy constructs are supported by the editing and analysis facilities in the CPN Palette tool package.
Keywords: hierarchies (in) coloured net(s); hierarchy construct: substitution transitions, substitution places, invocation transitions, fusion sets (for) places, fusion sets (for) transitions; coloured net sructuring; interrelated subnet(s); telephone system; multi-token ring protocol; CPN Palette tool package.