Towards a Standard for Modular Petri Nets: A Formalisation

  • Ekkart Kindler
  • Laure Petrucci
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5606)


When designing complex systems, mechanisms for structuring, composing, and reusing system components are crucial. Today, there are many approaches for equipping Petri nets with such mechanisms. In the context of defining a standard interchange format for Petri nets, modular PNML was defined as a mechanism for modules in Petri nets that is independent from a particular version of Petri nets and that can mimic many composition mechanisms by a simple import and export concept.

Due to its generality, the semantics of modular PNML was only informally defined. Moreover, modular PNML did not define which concepts could or should be subject to import and export in high-level Petri nets.

In this paper, we formalise a minimal version of modular high-level Petri nets, which is based on the concepts of modular PNML. This shows that modular PNML can be formalised once a specific version of Petri net is fixed. Moreover, we present and discuss some more advanced features of modular Petri nets that could be included in the standard. This way, we provide a formal foundation and a basis for a discussion of features to be included in the upcoming standard of a module concept for Petri nets in general and for high-level nets in particular.


Modular Petri Nets Standardisation High-Level Nets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    ISO/IEC: Software and Systems Engineering – High-level Petri Nets, Part 1: Concepts, Definitions and Graphical Notation, International Standard ISO/IEC 15909 (2004)Google Scholar
  2. 2.
    Kindler, E., Weber, M.: A universal module concept for Petri nets – an implementation-oriented approach. Informatik-Bericht 150, Humboldt-Universität zu Berlin, Institut für Informatik (2001)Google Scholar
  3. 3.
    Weber, M., Kindler, E.: The Petri Net Markup Language. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 124–144. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    ISO/JTC1/SC7/WG19: Software and Systems Engineering – High-level Petri Nets, Part 2: Transfer Format. FDIS 15909-2 (under ballot), v. 1.3.6, ISO/IEC (2008)Google Scholar
  5. 5.
    Kindler, E.: Modular PNML revisited: Some ideas for strict typing. In: Proc. AWPN 2007, Koblenz, Germany (2007)Google Scholar
  6. 6.
    Jensen, K., Kristensen, L.M., Wells, L.: Coloured Petri nets and CPN tools for modelling and validation of concurrent systems. Journal of Software Tools for Technology Transfer 9(3-4), 213–254 (2007)CrossRefGoogle Scholar
  7. 7.
    Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specifications 1, Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer, Heidelberg (1985)zbMATHGoogle Scholar
  8. 8.
    Berthomieu, B., Choquet, N., Colin, C., Loyer, B., Martin, J., Mauboussin, A.: Abstract Data Nets combining Petri nets and abstract data types for high level specification of distributed systems. In: Proceedings of VII European Workshop on Application and Theory of Petri Nets (1986)Google Scholar
  9. 9.
    Vautherin, J.: Parallel systems specifications with coloured Petri nets and algebraic specifications. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 266, pp. 293–308. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  10. 10.
    Billington, J.: Many-sorted high-level nets. In: Proceedings of the 3rd International Workshop on Petri Nets and Performance Models, pp. 166–179. IEEE Computer Society Press, Los Alamitos (1989)Google Scholar
  11. 11.
    Reisig, W.: Petri nets and algebraic specifications. Theoretical Computer Science 80, 1–34 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Choppy, C., Petrucci, L., Reggio, G.: A modelling approach with coloured Petri nets. In: Kordon, F., Vardanega, T. (eds.) Ada-Europe 2008. LNCS, vol. 5026, pp. 73–86. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Schmidt, K.: Verification of siphons and traps for algebraic Petri nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 427–446. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  14. 14.
    Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed coloured nets and their symbolic reachability graph. In: Jensen, K., Rozenberg, G. (eds.) Petri Nets: Theory and Application, pp. 373–396. Springer, Heidelberg (1991)Google Scholar
  15. 15.
    Christensen, S., Petrucci, L.: Modular analysis of Petri nets. The Computer Journal 43(3), 224–242 (2000)CrossRefzbMATHGoogle Scholar
  16. 16.
    Jensen, K.: Coloured Petri Nets: Basic concepts, analysis methods and practical use. Basic concepts. Monographs in Theoretical Computer Science, vol. 1. Springer, Heidelberg (1992)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ekkart Kindler
    • 1
  • Laure Petrucci
    • 2
  1. 1.Informatics and Mathematical ModellingTechnical University of DenmarkLyngbyDenmark
  2. 2.LIPN, CNRS UMR 7030, Université Paris XIIIVilletaneuseFrance

Personalised recommendations