Summary of Petri Nets

• Graphical formalism

• Distributed state (including buffering)

• Concurrency, sequencing and choice made explicit

• Analysis techniques based on

  • linear algebra (only sufficient)
  • structural analysis (necessary and sufficient only for FC)
  • unfolding

• Synthesis techniques based on

  • structural reductions (no minimization)
  • theory of regions (very expensive)

Previous slide

Next slide

Back to first slide

View graphic version