Messages can be arbitrarily delayed; no synchronized clocks.
No failure detection, but no arbitrary and malicious behavior either.
\(A_1\) | \(\emptyset\) |
\(A_2\) | (p1a, \(L_1\), 0) (p1a, \(L_2\), 0) |
\(A_3\) | (p1a, \(L_2\), 0) |
\(L_1\) | (p1b, \(A_1\), 0, null) |
\(L_2\) | \(\emptyset\) |
\(A_1\) | \(\emptyset\) |
\(A_2\) | (p1a, \(L_1\), 0) (p1a, \(L_2\), 0) |
\(A_3\) | (p1a, \(L_2\), 0) |
\(L_1\) | (p1b, \(A_1\), 0, null) |
\(L_2\) | \(\emptyset\) |
\(A_1\) | (p2a, 0, \(L_1\), 0) |
\(A_2\) | (p1a, \(L_1\), 0) (p1a, \(L_2\), 0) |
\(A_3\) | (p1a, \(L_2\), 0) |
\(L_1\) | \(\emptyset\) |
\(L_2\) | \(\emptyset\) |
\(x_1\) | \(x_2\) | \(x_3\) | \(v\) |
---|---|---|---|
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 1 | 0 |
0 | 1 | 0 | 0 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 0 |
1 | 0 | 1 | 0 |
1 | 0 | 0 | 0 |
\(x_1\) | \(x_2\) | \(v\) |
---|---|---|
0 | 0 | 0 |
0 | 1 | 0 & 1 |
1 | 1 | 1 |
1 | 0 | 0 & 1 |
Just find one bit for which both values can be reached (partial correctness).
/