Liveness, Fairness, and Recurrence in Petri Nets

Abstract

In Petri net theory, a transition is called live if from every reachable marking there starts a computation in which the transition occurs. Another important property of a transition is the recurrent occurrence of the transition in every computation. In that case, we call the transition recurrent. Though liveness and recurrence of a transition are similar… (More)
DOI: 10.1016/S0020-0190(99)00074-5

6 Figures and Tables

Topics

  • Presentations referencing similar topics