Petri net algebra
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Vicinity respecting homomorphisms for abstracting system requirements
Transactions on Petri nets and other models of concurrency IV
Factorization properties of symbolic unfoldings of colored petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Model checking inconsistency recovery costs
ICSOC'11 Proceedings of the 2011 international conference on Service-Oriented Computing
Channel properties of asynchronously composed petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
Petri nets are frequently composed of given nets. Literature suggests a lot of different composition operators, for different purposes and different classes of Petri nets. Formal definitions are frequently surprisingly technical, not matching the intuitive elegance of their graphical counterpart. We provide the formal framework for a simple composition operator, adequate for many classes of Petri net applications. It requires a minimum of fairly intuitive technicalities from its users and readers. The operator furthermore is associative, thus meeting the minimal algebraic requirements when composing a large system out of several smaller ones.