A note on deadlock-free proofs of network of processes

The processes in a network are categorized according to their functionalities at a given stage in the computation. A simple criterion for total correctness of a set of communicating processes is also given along with a necessary and sufficient condition to prove the absence of deadlock.