2. FairFifo
3.
e,e':E. loc(e) = loc(e') 
e <c e' 
e = e' e' <c e
4.
e:E. first(e) 
(e':E. loc(e') = loc(e) 
e' <c e)
t:
, i:Id.
first(<i,t>)
pred(<i,t>) <loc <i,t> & (e':E. (pred(<i,t>) <loc e' & e' <loc <i,t>))e,e':E. loc(e) = loc(e') e <c e' e = e' e' <c e
e:E. first(e) (e':E. loc(e') = loc(e) e' <c e)
t:, i:Id.
first(<i,t>)
pred(<i,t>) <loc <i,t> & (e':E. (pred(<i,t>) <loc e' & e' <loc <i,t>))| By: |
THEN Unfolds [`w-loc`;`w-time`] 0 THEN Reduce 0 THEN Try (Complete ((Analyze 0) THEN (Analyze 0) THEN (Analyze -1))) THEN SplitOnConclITE THENL [Auto;Id] |
| 1 |
6. 0<t 7. i:Id.
7. first(<i,t-1>)
7.
7. pred(<i,t-1>) <loc <i,t-1> 7. & ( e':E. (pred(<i,t-1>) <loc e' & e' <loc <i,t-1>))
8. t = 0
i:Id.
if isnull(a(i;t-1)) first(<i,t-1>) else false fi
if isnull(a(i;t-1)) pred(<i,t-1>) else <i,t-1> fi <loc <i,t>
& (e':E.
& ((if isnull(a(i;t-1)) pred(<i,t-1>) else <i,t-1> fi <loc e'
& ((& e' <loc <i,t>)) | 18 steps |
About:
 |  |  |  |  |
 |  |  |  |  |  |