For the most recent entries see the Petri Nets Newsletter.

Composition of algebraic high-level nets.

Dimitrovici, C.; Hummert, U.

In: Dosse, D,: Lecture Notes in Computer Science, Vol. 534; Recent trends in Data Type Specification, 7th Workshop, Wusterhausen, April 17-20, 1990, pages 52-73. Berlin; Heidelberg: Springer-Verlag,, 1991.

Abstract: The aim of this paper is the study, formulated in categorical terms, of semantics and composition of algebraic high-level nets, which are couples between algebraic net scheme and algebra. We show that the algebraic high-level nets can be composed in a elegant manner using colimits and especially pushouts. We define the semantics for algebraic high-level nets as a functor into the category of coloured nets and prove that it is compositional, i.e. this functor commutes with colimits, especially pushouts. Based on these results we reduce the analysis of net invariants of larger nets to computation of net invariants of components.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography