PN: Formalism Presentation
Petri Nets: Formal Presentation
Recall: Décidability
A property P on a set E is decidable if it exists an algorithm
such for every element of E it can gives the answer truth if
e has the property, and false in the other case.
aim : decide if a PN either possesses or no a property
Four types of analysis methods:
ˇ reachability (coverability) methods
ˇ linear algebra methods
ˇ reduction methods
ˇ structure analysis of the associated graph
Diapositiva precedente
Diapositiva successiva
Torna alla prima diaposiva
Visualizza versione grafica