| THM | rank_succ_two_invalid_ann | ( s:(state::  ):: []
(( p:(PId::  ):: []
(( q:(PId::  ):: []
(( r:(PId::  ):: []
((((((((((status-(q:: []PId?):: id):: []id)
(s:: []state):: ):: [] )
= ((Delright:: ):: [] ))::  ):: []
((((((status-(q:: []PId?):: id):: []id)
(s:: []state):: ):: [] )
= ((Delleft:: ):: [] ))::  ):: [] )::  )
:: []
 (((hasrank(s:: []state;r:: [] )::  ):: []
 ((((((rank(s:: []state;p:: [] ):: ):: [] )
= ((((rank(s:: []state;q:: [] ):: ):: [] )
+ (1:: [] ):: ):: [] ))::  ):: []
 ((((((rank(s:: []state;q:: [] ):: ):: [] )
= ((((rank(s:: []state;r:: [] ):: )
:: [] )
+ (1:: [] ):: ):: [] ))::  )
:: []
 ((((rank(((((("cs":: []Atomq:: []PId?
:: id)
:: []id):=((((invalid{}
:: ):: [] )
:: zexp)
:: []zexp):: com):: []com)
(s:: []state):: state)
:: []state;p:: [] ):: ):: [] )
= ((((rank(((((("cs":: []Atomq
:: []PId?:: id)
:: []id):=((((invalid{}
:: )
:: [] )
:: zexp)
:: []zexp):: com)
:: []com)
(s:: []state):: state)
:: []state;r:: [] ):: ):: [] )
+ (1:: [] ):: ):: [] ))::  )
:: [(rank(s;q) = rank(s;r) + 1)] )
::  ):: [(rank(s;p) = rank(s;q) + 1)] )
::  ):: [hasrank(s;r)] )::  )
:: [(status-q_ = Delright
status-q_ = Delleft)] )::  )
:: [(r PId)] )::  ):: [(q PId)] )::  )
:: [(p PId)] )::  ):: [(s state)] )::   |
| THM | rank_succ_two_off_ann | ( s:(state::  ):: []
(( p:(PId::  ):: []
(( q:(PId::  ):: []
(( r:(PId::  ):: []
(((hasrank(s:: []state;r:: [] )::  ):: []
 ((((((rank(s:: []state;p:: [] ):: ):: [] )
= ((((rank(s:: []state;q:: [] ):: ):: [] )
+ (1:: [] ):: ):: [] ))::  ):: []
 ((((((rank(s:: []state;q:: [] ):: ):: [] )
= ((((rank(s:: []state;r:: [] ):: ):: [] )
+ (1:: [] ):: ):: [] ))::  ):: []
 ((((rank(((((("status":: []Atomq:: []PId?
:: id):: []id):=((((Off:: )
:: [] )
:: zexp)
:: []zexp):: com):: []com)
(s:: []state):: state)
:: []state;p:: [] ):: ):: [] )
= ((((rank(((((("status":: []Atomq
:: []PId?:: id)
:: []id):=((((Off:: )
:: [] ):: zexp)
:: []zexp):: com):: []com)
(s:: []state):: state)
:: []state;r:: [] ):: ):: [] )
+ (1:: [] ):: ):: [] ))::  )
:: [(rank(s;q) = rank(s;r) + 1)] )::  )
:: [(rank(s;p) = rank(s;q) + 1)] )::  )
:: [hasrank(s;r)] )::  ):: [(r PId)] )::  )
:: [(q PId)] )::  ):: [(p PId)] )::  )
:: [(s state)] )::   |
| THM | is_proc_pid | n: . p: . isP(p)  p = p |
| THM | is_proc_vpids | n: . p: . isP(p)  p = p |
| THM | is_proc_vpid | n: . p: . isP(p)  p = p |
| THM | is_proc_pids | n: . p: . isP(p)  p = p |
| THM | is_proc_vproc | n: . p: . isP(p)  p = p |
| ML | is_proc_pid_ml | let IsProcPid p =
let t = member_of_wf_goal p in
if not is_var_term t then fail else
let ty = type_of_wf_goal p in
if not member ty [ P? ; P+m ; PId? ; P ; PId ] then fail else
find_hyp (\x. is_term `is_proc` x & subterm x 1 = t);
(DeannConcl THEN Try (Unfold `member` 0) THENM
Using2 [`n`, n ] (L `is_proc_pid`)
) p
;;
update_EqCD_additions `IsProcPid -- is_proc_pid_ml` IsProcPid ;; |
| DISP | hard_guard_df | {<t:term:*>}== {<t>} |
| ABS | hard_guard | {T} == T |
| THM | hard_guard_wf | T: . {T}  |
| THM | hard_guard_wf_ann | ( T:( :: '):: [] '
(((({T:: [] }:: ):: [] ) (( :: '):: [] ')):: '):: [(T )] ')
:: ' |
| THM | hard_guard_unfold | T: . {T} = T |
| THM | hard_guard_unfold_2 | T: . {T} = T |
| THM | hard_guard_fold | T: . T = {T} |
| THM | hard_guard_fold_ann | ( T:( :: {1'}):: [] '
(((T:: [] ) = (({T:: [] }:: ):: [] )):: '):: [(T  )] '):: ' |
| THM | hard_guard_unfold_2_ann | ( T:( :: {1'}):: [] '
(((({T:: [] }:: ):: [] ) = (T:: [] )):: '):: [(T  )] '):: ' |
| THM | hard_guard_unfold_ann | ( T:( :: '):: [] '
(((({T:: [] }:: ):: [] ) = (T:: [] )):: '):: [(T )] '):: ' |
| ABS | inv13o_char | inv13o_char{}(n; s; p; q; r) ==
purgeR(q::r::[]) buf[p]_
 visiting(s;q)
((r = nil rank(s;p) = 0)
(isP(r)
(isP(r)
 hasrank(s;p)
hasrank(s;r)
rank(s;p) = rank(s;r) + 1
(isP(r)  visiting(s;r))))) |
| THM | inv13o_char_wf | n: . s:state. p: . q:PId. r: . inv13o_char{}(n; s; p; q; r)   |
| THM | inv13o_char_wf_ann | ( n:( ::  ):: [] {2}
(( s:(state::  ):: [] {2}
(( p: :: [] {2}
(( q:(PId::  ):: [] {2}
(( r: :: [] {2}
((((inv13o_char{}((n:: [] );
(s:: []state);
(p:: [] );
(q:: []PId);
(r:: [] ))::  ):: [] )
(( :: {1'}):: [] {2})):: {2})
:: [(r )] {2}):: {2}):: [(q PId)] {2})
:: {2}):: [(p )] {2}):: {2}):: [(s state)] {2})
:: {2}):: [(n )] {2}):: {2} |
| THM | inv13o_char_unfold | n: . s:state. p: . q:PId. r: .
inv13o_char{}(n; s; p; q; r)
= (purgeR(q::r::[]) buf[p]_
 visiting(s;q)
((r = nil rank(s;p) = 0)
(isP(r)
(isP(r)
 hasrank(s;p)
hasrank(s;r)
rank(s;p) = rank(s;r) + 1
(isP(r)  visiting(s;r)))))) |
| THM | inv13o_char_unfold_ann | ( n:( ::  ):: [] {2}
(( s:(state::  ):: [] {2}
(( p: :: [] {2}
(( q:(PId::  ):: [] {2}
(( r: :: [] {2}
((((inv13o_char{}((n:: [] );
(s:: []state);
(p:: [] );
(q:: []PId);
(r:: [] ))::  ):: [] )
= ((((((((purgeR:: ):: [] ((((q:: [] )
::((((r:: [] )
::(([]:: List)
:: [] List))
:: List)
:: [] List))
:: List):: [] List)
:: mesg):: []mesg) ((buf[(p:: [] )]
(s:: []state)
:: mesg List)
:: []mesg List))::  )
:: []
 ((( ((visiting(s:: []state;q:: []PId)::  )
:: [] )::  ):: []
(((((((r:: [] ) = ((nil:: PId?):: [] ))
::  ):: []
((((rank(s:: []state;p:: [] ):: )
:: [] )
= (0:: [] ))::  ):: [] )::  )
:: []
(((isP((n:: [] ),(r:: [] ))::  )
:: []
(((isP((n:: [] ),(r:: [] ))::  )
:: []
 (((hasrank(s:: []state;p
:: [] )::  ):: []
(((hasrank(s:: []state;r
:: [] )::  ):: []
((((((rank(s:: []state;p
:: [] ):: )
:: [] )
= ((((rank(s
:: []state;r
:: [] ):: )
:: [] )
+ (1:: [] ):: )
:: [] ))::  )
:: []
(((isP((n:: [] ),(r
:: [] ))::  )
:: []
 (visiting(s
:: []state;r
:: []PId)::  )
:: [isP(r)] )
::  ):: [] )::  )
:: [] )::  ):: [] )
::  ):: [isP(r)] )::  )
:: [] )::  ):: [] )::  )
:: [] )::  ):: [(purgeR(q::r::[])
buf[p]_)] )::  )
:: [] )):: {2}):: [(r )] {2}):: {2})
:: [(q PId)] {2}):: {2}):: [(p )] {2}):: {2})
:: [(s state)] {2}):: {2}):: [(n )] {2}):: {2} |
| THM | inv13o_char_equiv | n: . s:state. p: . q:PId. r: .
inv13o_char{}(n; s; p; q; r)  inv13o{}(n; s; p; q; r) |
| THM | inv13o_char_equiv_ann | ( n:( ::  ):: []
(( s:(state::  ):: []
(( p: :: []
(( q:(PId::  ):: []
(( r: :: []
(((inv13o_char{}((n:: [] );
(s:: []state);
(p:: [] );
(q:: []PId);
(r:: [] ))::  ):: []
 (inv13o{}((n:: [] );
(s:: []state);
(p:: [] );
(q:: []PId);
(r:: [] ))::  )
:: [inv13o_char{}(n; s; p; q; r)] )::  )
:: [(r )] )::  ):: [(q PId)] )::  )
:: [(p )] )::  ):: [(s state)] )::  )
:: [(n )] )::   |
| ML | GetParto | let GetParto p =
let i = find_hyp (\t. is_term `list_el` t &
let t' = subterm t 2 in
is_term `mk_mesg` t' & is_term `purger` (subte
rm t' 1))
p in
OnInv13Part `o` (\j. Simple (FHyp j [i])) p
;; |
| THM | lemma13o_m1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( pp,q:P. r: . inv13o{}(n; (action_m1{} s); pp; q; r)) |
| THM | lemma13o_m2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( pp,q:P. r: . inv13o{}(n; (action_m2{} s); pp; q; r)) |
| ML | is_proc_pid_ml_fixed | let NewIsProcPid p =
let t = member_of_wf_goal p in
if not is_var_term t then fail else
let ty = type_of_wf_goal p in
if not member ty [ P? ; P+m ; PId? ; P ; PId ] then fail else
find_hyp (\x. is_term `is_proc` x & subterm x 2 = t) p ;
(DeannConcl THEN Try (Unfold `member` 0) THENM
Using2 [`n`, n ] (L (`is_proc_` ^ opid_of_term ty)) THEN
IfOnConcl (is_term `is_proc`) Hypothesis Id
) p
;;
update_EqCD_additions `IsProcPid -- is_proc_pid_ml` NewIsProcPid ;; |
| THM | lemma13o_m3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( pp,q:P. r: . inv13o{}(n; (action_m3{} s); pp; q; r)) |
| THM | lemma13o_m4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( pp,q:P. r: . inv13o{}(n; (action_m4{} s); pp; q; r)) |
| THM | lemma13o_p1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p1{}(p) s); pp; q; r)) |
| THM | lemma13o_p2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p2{}(p) s); pp; q; r)) |
| THM | lemma13o_p3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p3{}(p) s); pp; q; r)) |
| THM | lemma13o_p4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p4{}(p) s); pp; q; r)) |
| THM | lemma13o_p5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p5{}(p) s); pp; q; r)) |
| THM | lemma13o_p6_AXIOM | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,q:P. arg: .
entering(s;p)  (purgeR(p::arg::[]) buf[q]_)) |
| THM | lemma13o_p6_lemma | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,q:P. arg: .
entering(s;p)  (purgeR(p::arg::[]) buf[q]_)) |
| THM | lemma13o_p6 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p6{}(p) s); pp; q; r)) |
| THM | lemma13o_p7 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p7{}(p) s); pp; q; r)) |
| THM | lemma13o_p8 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p8{}(p) s); pp; q; r)) |
| THM | lemma13o_p9 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p9{}(p) s); pp; q; r)) |
| THM | inlist_implies_not_invalid | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p:P. status*p_ = Inlist  (cs*p_ = invalid{})) |
| THM | lemma13o_p10 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p10{}(p) s); pp; q; r)) |
| THM | lemma13o_p11 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p11{}(p) s); pp; q; r)) |
| THM | lemma13o_p12 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p12{}(p) s); pp; q; r)) |
| THM | lemma13o_p13 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p13{}(p) s); pp; q; r)) |
| THM | lemma13o_p14 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p14{}(p) s); pp; q; r)) |
| THM | lemma13o_p15 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p15{}(p) s); pp; q; r)) |
| THM | lemma3o_p16_lemma1 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . qval:P.
next_mesg(p;s.h) = purgeQ(pp::[])
 status*p_ = Inlist
 r = succ*p_
 (p = pp)
 (p = r)
 r = nil
 (r = nil
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp) = 0)
(isP(r)
(isP(r)
 hasrank(s;pp)
hasrank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp)
= rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
+ 1
(isP(r)
 idle(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
entering(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
leaving(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)]
(q*:=pp s))))));r))))) |
| THM | lemma13o_p16_lemma2_lemma | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . qval:P.
next_mesg(p;s.h) = purgeQ(pp::[])
 status*p_ = Inlist
 purgeR(q::p::[]) buf[pp]_
 ( idle(s;q) entering(s;q) leaving(s;q))
 isP(p)
 hasrank(s;pp)
 hasrank(s;p)
 rank(s;pp) = rank(s;p) + 1
 (isP(p)  idle(s;p) entering(s;p) leaving(s;p))
 (pp = p)
 isP(p)
 False) |
| THM | lemma13o_p16_lemma2 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . qval:P.
next_mesg(p;s.h) = purgeQ(pp::[])
 status*p_ = Inlist
 purgeR(q::r::[]) buf[pp]_
 { ( idle(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));q)
entering(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));q)
leaving(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));q))
((r = nil
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp) = 0)
(isP(r)
(isP(r)
 hasrank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp)
hasrank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp)
= rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
+ 1
(isP(r)
 idle(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
entering(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
leaving(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)]
(q*:=pp s))))));r)))))}) |
| THM | lemma13o_p16_lemma3 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . qval:P.
next_mesg(p;s.h) = purgeQ(qval::[])
 status*p_ = Inlist
 purgeR(q::r::[]) buf[pp]_
 (qval = pp)
 { ( idle(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));q)
entering(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));q)
leaving(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));q))
((r = nil
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));pp) = 0)
(isP(r)
(isP(r)
 hasrank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));pp)
hasrank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));r)
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));pp)
= rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));r)
+ 1
(isP(r)
 idle(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))));r)
entering(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)]
(q*:=qval s))))));r)
leaving(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;qval;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)]
(q*:=qval s))))));r)))))}) |
| THM | lemma13o_p16_lemma4 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . qval:P.
next_mesg(p;s.h) = purgeQ(qval::[])
 (status*p_ = Inlist)
 purgeR(q::r::[]) buf[pp]
([h<-(hsend(p;qval;purgeR(p
::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s))))
 { ( idle(s;q)
entering(s;q)
leaving(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s));q))
((r = nil
rank(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s));pp) = 0)
(isP(r)
(isP(r)
 hasrank(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s));pp)
hasrank(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s));r)
rank(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s));pp)
= rank(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=qval s));r)
+ 1
(isP(r)
 idle(s;r)
entering(s;r)
leaving(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)]
(q*:=qval s));r)))))}) |
| THM | lemma13o_p16_lemma5 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . qval:P.
next_mesg(p;s.h) = purgeQ(pp::[])
 status*p_ = Inlist
 r = succ*p_
 (p = pp)
 (p = r)
 (r = nil)
 (r = nil
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp) = 0)
(isP(r)
(isP(r)
 hasrank(s;pp)
hasrank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));pp)
= rank(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
+ 1
(isP(r)
 idle(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
entering(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)] (q*:=pp s))))));r)
leaving(status*p:=Off
(succ*p:=nil
(pred*p:=nil
([h<-(hsend(p;pp;purgeR(p::succ*p_::[]))
::h)]
(cs*p:=invalid{}
([h<-(hreceive(p;h)::h)]
(q*:=pp s))))));r))))) |
| THM | lemma13o_p16 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p16{}(p) s); pp; q; r)) |
| THM | lemma13o_p17 | n: . s:state.
in_exec{}(sci_program{}(n); s)
 inv13all_assump(n;s)
 ( p,pp,q:P. r: . inv13o{}(n; (action_p17{}(p) s); pp; q; r)) |