Symmetries of Petri Nets

Abstract

A definition of Petri net symmetries is given and an algorithm is introduced, which computes these symmetries. Then three examples are given how algorithms from different fields of Petri net analysis can be improved using symmetries, namely computation of reachability graphs, semipositive place invariants and structural deadlocks, respectively. 

1 Figure or Table

Topics

  • Presentations referencing similar topics