Skip to main content

Petri Nets

  • Reference work entry
Encyclopedia of Parallel Computing

Synonyms

Place-transition nets

Definition

A Petri Net is a graph model for the control behavior of systems exhibiting concurrency in their operation. The graph is bipartite, the two node types being places drawn as circles, and transitions drawn as bars. The arcs of the graph are directed and run from places to transitions or vice versa. Each place may be empty, or hold a finite number of tokens. The state of a Petri net is the distribution of tokens on its places, called a marking of the net. A transition is enabled if each of its input places holds at least one token. Firing a transition means removing one token from each input place and adding one token to each output place. A runof a Petri net is any sequence of firings of enabled transitions; a run defines a sequence of markings. Because many transitions may be enabled in a state, there are often many possible distinct runs of a Petri net. Hence, a Petri net represents a kind of nondeterministic state machine, but in a...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,799.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  1. David R, Alla H (2005) Discrete, continuous, and hybrid Petri Nets. Springer, Berlin

    MATH  Google Scholar 

  2. Girault C, Valk R (2003) Petri Nets for systems engineering. Springer, New York

    Google Scholar 

  3. Holt A, Commoner F (1970) Events and conditions. In: Record of the project MAC conference on concurrent systems and parallel computation. ACM, New York, pp 3–52

    Google Scholar 

  4. Jensen K (1995, 1996) Coloured Petri Nets: basic concepts, analysis methods and practical use. Monographs in theoretical computer science, vol 1, 2. Springer,

    Google Scholar 

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

    Google Scholar 

  6. Peterson JL (1981) Petri Net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  7. Petri CA (1962) Kommunikation mit automaten. Schriften des Institutes für Instrumentelle mathematik. Ph.D. dissertation, University of Bonn, Germany

    Google Scholar 

  8. Petri CA. http://www.informatik.uni-hamburg.de/TGI/mitarbeiter/profs/petri_eng.html

  9. Petri CA, Reisig W (2008) Petri net. Scholarpedia 3(4):6477. http://www.scholarpedia.org/article/Petri_net

  10. Ramchandani C (Feb 1974) Analysis of asynchronous concurrent systems by Petri Nets. Technical Report MIT/LCS/TR-120, MIT Laboratory for Computer Science

    Google Scholar 

  11. Springer (1980) Application and theory of Petri Nets. In: Informatik fachberichte; (1984–1993) Advances in Petri Nets. Lecture notes in computer science, vol 10; (1992–2009) Applications and theory of Petri Nets. Lecture notes in computer science, vol 18. Springer, Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Dennis, J.B. (2011). Petri Nets. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_134

Download citation

Publish with us

Policies and ethics