move everything out of trunk

[lttv.git] / trunk / verif / Spin / Test / leader_trace

diff --git a/trunk/verif/Spin/Test/leader_trace b/trunk/verif/Spin/Test/leader_trace
deleted file mode 100755 (executable)
index a81f7e9..0000000
--- a/trunk/verif/Spin/Test/leader_trace
+++ /dev/null
@@ -1,96 +0,0 @@
-/* Dolev, Klawe & Rodeh for leader election in unidirectional ring
- * `An O(n log n) unidirectional distributed algorithm for extrema
- * finding in a circle,'  J. of Algs, Vol 3. (1982), pp. 245-260
- */
-
-#define N      5       /* nr of processes (use 5 for demos) */
-#define I      3       /* node given the smallest number    */
-#define L      10      /* size of buffer  (>= 2*N) */
-
-mtype = { one, two, winner };
-chan q[N] = [L] of { mtype, byte};
-
-byte nr_leaders = 0;
-
-notrace {
-       do
-       :: q[0]?one,_
-       :: q[0]?two,_ -> break
-       od;
-       do
-       :: q[0]?two,_
-       :: q[0]?winner,_ -> break
-       od
-}
-
-proctype node (chan in, out; byte mynumber)
-{      bit Active = 1, know_winner = 0;
-       byte nr, maximum = mynumber, neighbourR;
-
-       xr in;
-       xs out;
-
-       printf("MSC: %d\n", mynumber);
-       out!one(mynumber);
-end:   do
-       :: in?one(nr) ->
-               if
-               :: Active -> 
-                       if
-                       :: nr != maximum ->
-                               out!two(nr);
-                               neighbourR = nr
-                       :: else ->
-                               /* Raynal p.39:  max is greatest number */
-                               assert(nr == N);
-                               know_winner = 1;
-                               out!winner,nr;
-                       fi
-               :: else ->
-                       out!one(nr)
-               fi
-
-       :: in?two(nr) ->
-               if
-               :: Active -> 
-                       if
-                       :: neighbourR > nr && neighbourR > maximum ->
-                               maximum = neighbourR;
-                               out!one(neighbourR)
-                       :: else ->
-                               Active = 0
-                       fi
-               :: else ->
-                       out!two(nr)
-               fi
-       :: in?winner,nr ->
-               if
-               :: nr != mynumber ->
-                       printf("MSC: LOST\n");
-               :: else ->
-                       printf("MSC: LEADER\n");
-                       nr_leaders++;
-                       assert(nr_leaders == 1)
-               fi;
-               if
-               :: know_winner
-               :: else -> out!winner,nr
-               fi;
-               break
-       od
-}
-
-init {
-       byte proc;
-       atomic {
-               proc = 1;
-               do
-               :: proc <= N ->
-                       run node (q[proc-1], q[proc%N], (N+I-proc)%N+1);
-                       proc++
-               :: proc > N ->
-                       break
-               od
-       }
-}
-