Petri net

  • Authors:
  • Michael K. Molloy;James L. Peterson

  • Affiliations:
  • -;-

  • Venue:
  • Encyclopedia of Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Petri nets are a popular and useful model for the representation of systems with concurrency or parallelism. They are named for Carl Adam Petri, who developed them in the early 1960s at the University of Bonn, Germany. A Petri net (see Fig. 1) is a graph with two types of nodes--places and transitions. Places are drawn as circles, while transitions are drawn as bars. Directed arcs (arrows) connect places to transitions and transitions to places. For each transition, the directed arcs define its input places (arc from place to transition) and its output places (arc from transition to place).