Example of Possible Analysis with PN
Besides the modeling capabilities of PN, their support for analysis is very important and useful. This analysis is based on the properties of the mathematical model of PN. Some of these properties are:
- Reachability: is there a sequence of firing that reaches a given state?
- Boundness: will a place be overloaded? A PN is defined as k-bounded if the number of tokens in each place does not exceed k.
- Liveness: is there any state or sequence of states which will not be reached anymore, indicating a possible deadlock?
- Reversibility: is it possible to return to a defined initial state M0?
- Persistence: is the firing of any pair of enabled transitions interdependent, i.e., the firing of one will disable the other?
- Synchronic Distance: defines a metric related to the degree of mutual dependence between two transitions.