-- establishes: some entering => <> some in competition --------------------------------------------------------- -- [kedar] adds variables to check whether there is a -- process in a particular local state. MODULE main DEFINE -- N := 11; N := 3; M := 1; R := 3; P := | for(i=1;i<=N;i=i+1) { loc[i] in {2,3} }; Q := | for(i=1;i<=N;i=i+1) { 4<=loc[i] & loc[i]<=10 }; VAR loc : array 1..N of 0..14; cnt : array 1..N of 0..M; rnd : 0..R; pend: boolean; for (i=1;i<=N;i=i+1) { P[i] : process Pr(i,loc,cnt,rnd,pend,N,M,R,at,aten); } -- [kedar] added move recorder for debugging. -- move: 1..N; -- [kedar] counting variables. -- syntax: -- at[k] is true if some process is at k -- aten[k] is true if some process is at k and cnt=1 for that process. -- (i.e., it has yet to make a move) at: array 0..14 of boolean; aten: array 0..14 of boolean; Id : Idle; ASSIGN for (i=1; i<=N; i=i+1) { init(loc[i]) := 0; init(cnt[i]) := 0; } init(pend) := 0; init(rnd) := 0; -- init(move) := 1; init(at[0]) := 1; init(aten[0]) := 0; for (i=1;i<=14;i=i+1) { init(at[i]) := 0; init(aten[i]) := 0;} MODULE Idle MODULE Pr(i,loc,cnt,rnd,pend,N,M,R,at,aten) DEFINE for (k=1;k<=N;k=k+1) { hi[k] := loc[k] in {12,11,10,6,5} ; lo[k] := loc[k] in {8,9} ; t[k] := loc[k] in {4,7} ; u[k] := loc[k] in {0,1} ; e[k] := loc[k] in {2,3} ; a[k] := loc[k] in {13,14}; } cond_56 := some_h | some_a; cond_74 := !some_h & !some_a; cond_89 := !(some_h | some_t | some_a); cond_23 := !(some_h | some_l | some_t) | some_a; cond_10_12 := !some_t & !some_l & !some_h; -- assume mutex is established cond_13_14 := !some_e; some_t := | for(k=1;k<=N;k=k+1) {(i!=k & t[k])}; some_h := | for(k=1;k<=N;k=k+1) {(i!=k & hi[k])}; some_l := | for(k=1;k<=N;k=k+1) {(i!=k & lo[k])}; some_a := | for(k=1;k<=N;k=k+1) {(i!=k & a[k])}; some_e := | for(k=1;k<=N;k=k+1) {(i!=k & e[k])}; P_pri := | for(k=1;k<=N;k=k+1) { next(loc[k]) in {2,3} }; Q_pri := | for(k=1;k<=N;k=k+1) { 4<=next(loc[k]) & next(loc[k])<=10 }; cnt-empty := & for(k=1;k<=N;k=k+1) { k=i | cnt[k]=0 } & cnt[i]=1; ASSIGN -- next(move) := i; next(loc[i]) := case loc[i]=0 : {0,1}; loc[i]=1 : 2; loc[i]=2 & cond_23 : 3; loc[i]=3 : 4; loc[i]=4 : {5,8}; loc[i]=5 & cond_56 : 6; loc[i]=5 : 10; loc[i]=6 : 7; loc[i]=7 & cond_74 : 4; loc[i]=8 & cond_89 : 9; loc[i]=9 : 4; loc[i]=10 & cond_10_12: 12; loc[i]=10 : 11; loc[i]=11 : 0; loc[i]=12 : 13; loc[i]=13 & cond_13_14: 14; loc[i]=14 : 0; 1 : loc[i]; esac; next(pend) := case P_pri & !Q_pri : 1; Q_pri : 0; 1 : pend; esac; for (k=1;k<=N;k=k+1) { next(cnt[k]) := case !pend & next(pend) : M; -- replenish counters pend & next(pend) & cnt-empty: M; -- replenish counters pend & next(pend) & i=k & cnt[i]>0 : cnt[k] - 1; !next(pend) : 0; 1 : cnt[k]; esac; } next(rnd) := case !pend & next(pend) : 0; pend & next(pend) & cnt-empty & rnd