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
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
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
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Generalised Composition Operations for High-level Petri Nets
Fundamenta Informaticae
| Hi-index | 0.00 |
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 allow for weak and strong versions of compositions (owing to a parameterised scheme of type construction). Important properties, including associativity, commutativity, and coherence w.r.t. unfolding, are preserved.