PN: Formalism Presentation

Petri Nets: Formal Presentation

Reversibility

A Petri net is reversible iff its reachable tree is

strongly connected

Practical method for the analysis of the properties

of a bounded Petri net

1- prove that it is k-bounded,

2- prove that it is reversible

3 - prove that it is quasi-live

If the net is quasi-live and reversible it is also live, Why?

Diapositiva precedente

Diapositiva successiva

Torna alla prima diaposiva

Visualizza versione grafica