Deadlock-free completely connected networks: towards a #x03C0;-calculus approach

摘要

A very general communication protocol is presented, which enables communication, without danger of deadlock, in a class of networks of asynchronous processes that communicate synchronously, subject to certain fairness constraints on the individual node processes. Deadlock freedom is first proved using the process algebra CCS, but the proof uses the dynamic scoping of channels which is more naturally described by the #x03A0;-calculus.