chapter 6 - Convergence in the Presence of Faults1-35 How can a Byzantine processor prevent reaching 0, simultaneously even after M-1 rounds n-f-1 = 2  f= 1 This strategy can yield an infinite execution in which the clock values of the non-faulty processors will never be synchronized  100 1 1 0 P1P1 P2P2 P3P3 P4P4 will reset  010 0 1 1 P1P1 P2P2 P3P3 P4P4  100 1 1 0 P1P1 P2P2 P3P3 P4P4
{}