80 likes | 255 Views
Heuristics for Ample Sets. Flavio Lerda. The Conditions. C0: ample (s) = iff enabled (s) = C1: ( dep ( ample (s)) ample (s)) ¬ = 1 2 ... n i ample (s) C2: ample (s) enabled (s) ample (s). is invisible C3:
E N D
Heuristics for Ample Sets Flavio Lerda
The Conditions • C0: • ample(s) = iff enabled(s) = • C1: • (dep(ample(s)) \ ample(s)) ¬ = 1 2 ...n iample(s) • C2: • ample(s) enabled(s) ample(s). is invisible • C3: • A cycle is not allowed if it contains a state in which some transition is enabled, but it is never included in ample(s) for any state s on the cycle.
x++ recv(x) send(1) Example
Example x++ recv(x) send(1)
x++ recv(x) send(1) Example
Example x++ recv(x) send(1)
Example x++ recv(x) send(1)
Example x++ recv(x) send(1)