When considering the algorithm described in Fig. 17.1, let us replace the MS assumption by a weaker probabilistic MS assumption stating that there a positive probability that, after some time, there...

When considering the algorithm described in Fig. 17.1, let us replace the MS assumption by

a weaker probabilistic MS assumption stating that there a positive probability that, after some

time, there is a round r during which the processes receive the round r messages from the same

set of (n − t) correct processes. Show that when r tends to infinity, the probability that the

processes decide tends to 1.

Solution in [83].