Simple Composition of Nets
- 667 Downloads
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.
Unable to display preview. Download preview PDF.
- 1.Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer Monographs in Theoretical Computer Science (2001)Google Scholar