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.
Get full access to this article
View all access options for this article.