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)
5.
e:E.
5.
first(e)
5.
5. loc(pred(e)) = loc(e) & pred(e) <c e
5. & (
e':E. loc(e') = loc(e) (pred(e) <c e' & e' <c e))
6.
e:E. first(e) (x:Id. (x when e) = (x after pred(e)))
7. Trans e,e':E. e <c e'
8. SWellFounded(e <c e')
9.
e:E.
9. isrcv(kind(e))
9.
9. sends(lnk(kind(e));sender(e))[index(e)]
9. =
9. msg(lnk(kind(e));tag(kind(e));val(e))
10.
e:E. isrcv(kind(e)) sender(e) <c e
11.
e,e':E.
11. e <c e'
11.
11.
first(e') & e <c pred(e') e = pred(e')
11.
isrcv(kind(e')) & e <c sender(e') e = sender(e')
12.
e:E. isrcv(kind(e)) loc(e) = destination(lnk(kind(e)))
13.
e:E, l:IdLnk. loc(e) = source(l) sends(l;e) = nil
14. e : E
15. e' : E
16. isrcv(kind(e))
17. isrcv(kind(e'))
18. lnk(kind(e)) = lnk(kind(e'))
19. match(lnk(kind(e));mu(
t.match(lnk(kind(e));t;time(e)));time(e))
20. match(lnk(kind(e'));mu(
t.match(lnk(kind(e'));t;time(e')));time(e'))
e <loc e'
<source(lnk(kind(e)))
,mu(t.
,match(lnk(kind(e));t;time(e)))> <loc <source(lnk(kind(e')))
,match(lnk(kind(e));t;time(e)))> <loc ,mu(t.
,match(lnk(kind(e));t;time(e)))> <loc ,match(lnk(kind(e'));t;time(e')))>
<source(lnk(kind(e)))
,mu(t.match(lnk(kind(e));t;time(e)))> = <source(lnk(kind(e')))
,mu(t.match(lnk(kind(e));t;time(e)))> = ,mu(t.
,mu(t.match(lnk(kind(e));t;time(e)))> = ,match(lnk(kind(e'));t;time(e')))>
& ||rcvs(lnk(kind(e));time(e))||
& -||snds(lnk(kind(e));time(<source(lnk(kind(e)))
& -||snds(lnk(kind(e));time(,mu(t.
& -||snds(lnk(kind(e));time(,match(lnk(kind(e));t;time(e)))>))||<||rcvs(lnk(kind(e'));time(e'))||
& -||snds(lnk(kind(e'));time(<source(lnk(kind(e')))
& -||snds(lnk(kind(e'));time(,mu(t.match(lnk(kind(e'));t;time(e')))>))||
n:
. (
