Let an anonymous version of Ω (denoted AΩ) be defined as follows. Each process pi is equipped with a read-only Boolean variable leaderi, such that, after a finite but arbitrarily long period, the...

Let an anonymous version of Ω (denoted AΩ) be defined as follows. Each process pi is equipped

with a read-only Boolean variable leaderi, such that, after a finite but arbitrarily long period, the

local variable of a single correct process remains forever equal to true, and the local variables

of all the other processes remain forever equal to false.

An algorithm assumed to implement multivalued consensus in CAMPn,t[t <>

in Fig. 17.9, which implements binary consensus in the hybrid model CAMPn,t[t <>

Is this algorithm correct? If it is not, find a counter-example. If it is, provide a proof.

Solution in [366].