Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Petri Nets

  • W. M. P. van der AalstEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_817


Colored nets; Condition event nets; Place transition nets


The Petri net formalism provides a graphical but also formal language which is appropriate for modeling systems and processes with concurrency and resource sharing. It was introduced in the beginning of the 1960s by Carl Adam Petri and was the first formalism to adequately describe concurrency. The classical Petri net is a directed bipartite graph with two node types called places and transitions. The nodes are connected via directed arcs. Places are represented by circles and transitions by rectangles. The network structure of the Petri net is static. However, places may contain tokens, and the distribution of tokens of places may change as described in the firing rule. Petri nets have formal semantics and allow for all kinds of analysis. Moreover, due to the strong theoretical foundation, much is known about the properties of different subclasses of Petri nets. Petri nets have been extended in many...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Brauer W, Reisig W. Carl Adam Petri and Petri Nets. Informatik-Spektrum. 1996;29(5):369–74.Google Scholar
  2. 2.
    Desel J, Esparza J. Free choice Petri nets, Cambridge tracts in theoretical computer science, vol. 40. Cambridge, UK: Cambridge University Press; 1995.zbMATHCrossRefGoogle Scholar
  3. 3.
    Jensen K, Kristensen LM, Wells L. Coloured Petri nets and CPN tools for modelling and validation of concurrent systems. Int J Softw Tools Technol Trans. 2007;9(3–4):213–54.CrossRefGoogle Scholar
  4. 4.
    Murata T. Petri nets: properties, analysis and applications. Proc IEEE. 1989;77(4):541–80.CrossRefGoogle Scholar
  5. 5.
    Petri CA. Kommunikation mit Automaten. PhD Thesis, Fakultät für Mathematik und Physik, Technische Hochschule Darmstadt, Darmstadt, 1962.Google Scholar
  6. 6.
    Reisig W, Rozenberg G, editors. Lectures on Petri nets I: basic models. Berlin/Heidelberg/New York: Springer; 1998.zbMATHGoogle Scholar
  7. 7.
    van der Aalst WMP. The application of Petri nets to workflow management. J Circ Syst Comput. 1998;8(1):21–66.CrossRefGoogle Scholar
  8. 8.
    van der Aalst WMP, van Hee KM. Workflow management: models, methods, and systems. Cambridge, MA: MIT Press; 2004.Google Scholar
  9. 9.
    van der Aalst WMP. Process Mining: Data Science in Action. Springer-Verlag, Berlin, 2016.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Eindhoven University of TechnologyEindhovenThe Netherlands

Section editors and affiliations

  • Barbara Pernici
    • 1
  1. 1.Dept. di Elettronica e InformazionePolitecnico di MilanoMilanItaly