Model and complexity of termination for distributed computations

We define a model to describe the global running of a network of processes, as well as termination detection. We find algorithms required to be super-imposed on the system without disturbing the underlying computation. In the case of asynchronous protocols, we prove that the complexity of termination detection is equal to the number of messages of the initial computation.