Bounded-ness
Bounded-ness submits to the finite amount of resource needs. This can also model absent of overflows in the buffers. Additionally, a bounded Petri net builds up a finite reach-ability set and forms a significant criterion for analyzing performance employing Petri net models.
A place of a Petri net is termed as k-bounded if,
- k > 0
- k ∈ I
- M ( pi ) ≤ k ∀M ∈ R [M 0]
Here k- bounded-ness is stated for initial marking M0.
If K = 1, pi is said to be safe in a marking M0.