Abstract
We propose generic schemes for basic composition operations (sequential composition, choice, iteration, and refinement) for high-level Petri nets. They tolerate liberal combinations of place types (equal, disjoint, intersecting) and, owing to a parameterised scheme of type construction, allow for weak and strong versions of compositions. Properties such as associativity, commutativity, and coherence with respect to unfolding, are preserved.
Get full access to this article
View all access options for this article.