Let us consider the system model CSMPn,t[SO] (the send omission failure model introduced in Section 10.6), where a faulty process is a process that crashes, or a process that forgets to send messages...

Let us consider the system model CSMPn,t[SO] (the send omission failure model introduced in

Section 10.6), where a faulty process is a process that crashes, or a process that forgets to send

messages (hence a faulty process that does not crash forgets to send at least one message).

Figure 12.9: A simple k-set agreement algorithm for the model CSMPn,t[SO] (code for pi)

• Prove that the algorithm described in Fig. 12.9 implements k-set agreement in CSMPn,t[SO].

• Prove that this algorithm does not work in the general omission failure model CSMPn,t[GO],

which is is the same as CSMPn,t[SO] where in addition a process can omit to receive messages).

Solutions in [367]