Abstract: This paper presents "Communicating Wait-For Graph" (CWFG) model to analyse communication relationship among the processes of a parallel system For the CWFG Model, it gives the distributed and dynamic detection algorithm of communication deadlock in the parallel programs. In the parallel environment, the model is the instant CWFG (ICWFG). The algorithm finds some cycles of ICWFG and is proved correctly-