Coverability Graph
For example, from M0 = [3 0 0 2]T, M1 = [2 1 0 2]T is the only reachable state;
it can be reached by firing t1.
M0
M3
M7
M1
M5
M8
M2
M6
M4
t1
t1
t1
t1
t1
t1
t2
t2
t2
t2
t2
t3
t3
t3
t3
t3
Previous slide
Next slide
Back to first slide
View graphic version