Core of FLP result in words  In an initially bivalent state, they look at some execution that would lead to a decision state, say 0  At some step this run switches from bivalent to univalent, when some process receives some message m  They now explore executions in which m is delayed
{}