Heuristics for Ample Sets

1. Heuristics for Ample Sets Flavio Lerda

2. 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: • 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.

3. x++ recv(x) send(1) Example

4. Example x++ recv(x) send(1)

5. x++ recv(x) send(1) Example

6. Example x++ recv(x) send(1)

7. Example x++ recv(x) send(1)

8. Example x++ recv(x) send(1)