Transcript Heuristics for Ample Sets

LTL to Büchi Automata
15-820A
Heuristics for Ample Sets
Flavio Lerda
1
LTL to Büchi Automata
15-820A
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.
2
LTL to Büchi Automata
15-820A
Example
x++
recv(x)
send(1)
3
LTL to Büchi Automata
15-820A
Example
x++
recv(x)
send(1)
4
LTL to Büchi Automata
15-820A
Example
x++
recv(x)
send(1)
5
LTL to Büchi Automata
15-820A
Example
x++
recv(x)
send(1)
6
LTL to Büchi Automata
15-820A
Example
x++
recv(x)
send(1)
7
LTL to Büchi Automata
15-820A
Example
x++
recv(x)
send(1)
8