Generalised Composition Operations for High-level Petri Nets

Authors:
Eike Best;Alexander Lavrov
Affiliations:
Department of Parallel Systems, Faculty of Computer Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. {eike.best,alexander.lavrov}@informatik.uni-oldenburg.de;(Correspd.) Department of Parallel Systems, Faculty of Computer Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. {eike.best,alexander.lavrov}@informatik.uni-olde ...
Venue:
Fundamenta Informaticae
Year:
1999

Citing 7
Cited 0

Petri net algebra

Petri net algebra
Weak and Strong Composition of High-Level Petri-Nets

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Modular Completeness for Communication Closed Layers

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
General Refinement for High Level Petri Nets

Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2

Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Refinement of Coloured Petri Nets

FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
A Petri Net Semantics for B(PN)^2 with Procedures

PDSE '97 Proceedings of the 2nd International Workshop on Software Engineering for Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.