Summary: A distributed scheme for detecting communication deadlocks and a correctness proof of the algorithm were given by N. Natarajan. It is shown in this correspondence that the proof is not strict.