Simple Composition of Nets

  • Wolfgang Reisig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5606)


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.

Unable to display preview. Download preview PDF.


  1. 1.
    Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer Monographs in Theoretical Computer Science (2001)Google Scholar
  2. 2.
    Christensen, S., Petrucci, L.: Modular Analysis of Petri Nets. Computer Journal 43(3), 224–242 (2001)CrossRefzbMATHGoogle Scholar
  3. 3.
    Gomes, L., Barros, J.P.: Structuring and Composability Issues in Petri Nets Modeling. IEEE Transactions on Industrial Informatics 1(2), 112–123 (2005)CrossRefGoogle Scholar
  4. 4.
    Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Wolfgang Reisig
    • 1
  1. 1.Humboldt-Universität zu BerlinGermany

Personalised recommendations