In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 524; Advances in Petri Nets 1991, pages 93-117. Berlin, Germany: Springer-Verlag, 1991.
Abstract: The aim of this paper is the study of semantics, compositionality and net properties (as quasi-liveness of transitions, boundedness of places, termination of nets, deadlocks, coverness) of algebraic high-level nets in a categorial framework. The authors show that the algebraic high-level nets can be composd using colimits and especially pushouts. The authors define two kinds of semantics for high-level nets: the standard semantics and normed scheme semantics, prove that both semantics are compositional, and study in which way the above net properties can be analyzed.
Keywords: algebraic high-level net semantics (and) composition; (quasi-) liveness; boundedness; termination; deadlock; coverness; category theory; colimit; pushout; normed scheme semantics; coloured net; net invariant.