A hundred impossibility proofs for distributed computing
Nancy Ann Lynch · 1989
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