Skip to main content

Petri Nets

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

Colored nets; Condition event nets; Place transition nets

Definition

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 via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Brauer W, Reisig W. Carl Adam Petri and Petri Nets. Informatik-Spektrum. 1996;29(5):369–74.

    Google Scholar 

  2. Desel J, Esparza J. Free choice Petri nets, Cambridge tracts in theoretical computer science, vol. 40. Cambridge, UK: Cambridge University Press; 1995.

    Book  MATH  Google Scholar 

  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.

    Article  Google Scholar 

  4. Murata T. Petri nets: properties, analysis and applications. Proc IEEE. 1989;77(4):541–80.

    Article  Google Scholar 

  5. Petri CA. Kommunikation mit Automaten. PhD Thesis, Fakultät für Mathematik und Physik, Technische Hochschule Darmstadt, Darmstadt, 1962.

    Google Scholar 

  6. Reisig W, Rozenberg G, editors. Lectures on Petri nets I: basic models. Berlin/Heidelberg/New York: Springer; 1998.

    MATH  Google Scholar 

  7. van der Aalst WMP. The application of Petri nets to workflow management. J Circ Syst Comput. 1998;8(1):21–66.

    Article  Google Scholar 

  8. van der Aalst WMP, van Hee KM. Workflow management: models, methods, and systems. Cambridge, MA: MIT Press; 2004.

    Google Scholar 

  9. van der Aalst WMP. Process Mining: Data Science in Action. Springer-Verlag, Berlin, 2016.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to W. M. P. van der Aalst .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

van der Aalst, W.M.P. (2016). Petri Nets. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_817-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_817-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics