Affiliations: Institute of Computer Science of PAS, Concurrency Theory Group, PKiN, P.O. Box 22, 00-901 Warsaw, Poland
Note: [1] The revised version of a lecture given at the GMD Workshop “Combining Compositionality and Concurrency” held in Koenigswinter, FRG, March 2nd – 4th, 1988 (its preliminary version has been published in Lecture Notes in Computer Science, series “Advances in Petri Nets”).
Abstract: The notion of synchronization of qualified pomsets (pomsets equipped with an alphabet) is introduced and some properties of this operation are given. It is claimed that the synchronization operation is a sufficient tool for composing complex concurrent systems from a set of simple atomic ones. As an example the behaviour of pure place/transition Petri nets is defined by means of qualified pomset synchronization.
Keywords: Compositionality, modularity, concurrency, pomsets, algebras, Petri nets, semantics
