A Hundred Impossibility Proofs for Distributed Computing

this technical assumption is necessary.) The arguments are basically similar to those of based on the pigeonhole principle applied to values of shared memory, only in place of case analysis there is a more systematic examination of executions

A Hundred Impossibility Proofs for Distributed Computing | Litlas