maggicl/soft-an04
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

First LTL property implemented

Browse source
This commit is contained in:
Claudio Maggioni 2023-05-08 16:15:17 +02:00
parent 5fcfb5ea8e
commit 6f31f57b32
2 changed files with 62 additions and 26 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

62
ReversalModel/reversal.pml
View file

@ -3,10 +3,15 @@
#define R 2 #define R 2
int to_reverse[LENGTH]; // array to reverse int to_reverse[LENGTH]; // array to reverse
int reversed[LENGTH]; // array where the reverse is stored int reversed_seq[LENGTH]; // for SequentialReverser: where the reverse is stored
int reversed_par[LENGTH]; // for ParallelReverser: where the reverse is stored
// stores termination of each pid // stores termination of each reverser
bool done[N]; // initialized to false // index 0 is for the sequential algorithm
// indices 1-N are for the ThreadedReverser instances
bool done[N + 1]; // initialized to false
bool seq_eq_to_parallel = true;
// ThreadedReverser implementation // ThreadedReverser implementation
proctype ThreadedReverser(int from; int to; int n) { proctype ThreadedReverser(int from; int to; int n) {
@ -14,8 +19,8 @@ proctype ThreadedReverser(int from; int to; int n) {
int k; int k;
for (k: from .. to) { for (k: from .. to) {
printf("reversed[%d] = to_reverse[%d]\n", LENGTH - k - 1, k); printf("reversed_par[%d] = to_reverse[%d]\n", LENGTH - k - 1, k);
reversed[LENGTH - k - 1] = to_reverse[k]; reversed_par[LENGTH - k - 1] = to_reverse[k];
} }
printf("proc[%d]: ended\n", n); printf("proc[%d]: ended\n", n);
@ -35,31 +40,62 @@ init {
} }
} }
printf("sequential start\n");
// SequentialReverser implementation
{
int k;
for (k: 0 .. (LENGTH - 1)) {
reversed_par[LENGTH - k - 1] = to_reverse[k];
printf("reversed_seq[%d] = to_reverse[%d]\n", LENGTH - k - 1, k);
}
done[0] = true; // mark sequential end
}
printf("sequential end\n");
printf("parallel start\n");
// ParallelReverser implementation // ParallelReverser implementation
{
int n; int n;
int s = LENGTH / N; int s = LENGTH / N;
// fork section // fork section
for (n: 0 .. (N - 1)) { for (n: 1 .. N) {
int from = n * s; int from = n * s;
int to; int to;
if if
:: (n == N - 1) -> to = LENGTH - 1; :: (n == N - 1) -> to = LENGTH - 1;
:: else -> to = n * s + s - 1; :: else -> to = n * s + s - 1;
fi fi
run ThreadedReverser(from, to, n); run ThreadedReverser(from, to, n); // run as "thread n"
} }
// join section // join section
for (n: 0 .. (N - 1)) { for (n: 1 .. N) {
(done[n] == true); (done[n] == true); // wait "thread n"
printf("init: joined process %d\n", n); printf("[%d] joined\n", n);
} }
}
printf("parallel end\n");
printf("program end\n"); // test if seq and parallel are the same
{
int i;
for (i: 0 .. (LENGTH - 1)) {
if
:: (reversed_seq[i] != reversed_par[i]) -> seq_eq_to_parallel = false;
fi
}
}
} }
// ltl syntax: https://spinroot.com/spin/Man/ltl.html // ltl syntax: https://spinroot.com/spin/Man/ltl.html
ltl test {
(done[N - 1] == false) U (reversed[LENGTH - 1] == to_reverse[0]) ltl seq_eq_parallel {
// the variable seq_eq_to_parallel will never be false if all the elements
// between the sequential and parallel reversed arrays are equal
(done[0] == false || done[N] == false) U (seq_eq_to_parallel == true)
}
ltl termination {
<> (done[0] == true && done[N] == true)
} }

2
ReversalModel/verify.sh
View file

@ -11,7 +11,7 @@ set -e
spin -a reversal.pml spin -a reversal.pml
gcc-13 -Wno-format-overflow -DPRINTF -o pan pan.c gcc-13 -Wno-format-overflow -DPRINTF -o pan pan.c
./pan -a "$1" ./pan -a -N "$1"
exitcode="$?" exitcode="$?"