The next step is to prove that this strategy is dominating the predicate.
The proof depending on the heard-of predicate generated by \(f_{n-F}\) , it
is computed first. This heard-of predicate was given
by Charron-Bost and Schiper [1]} as a characterization of
the asynchronous model with reliable communication and
at most \(F\)  crashes. The intuition behind it is that even in the absence of
crashes, we can make all the processes change round by delivering any set
of at least \(n-F\)  messages to them.
