About the termination detection in the asynchronous message passing model
Résumé
This paper presents a complete characterisation of the families of networks in which distributed computations can be performed in a process terminating manner, that is with explicit termination (at least one node of the network knows that every node has obtained its final state) in the asynchronous message passing model. The characterisation encompasses all criteria that have been formulated in the past that were known to influence explicit termination: topological restriction (tree), topological knowledge (size or diameter), and local knowledge to distinguish nodes (identities or a leader). These results are now presented as corollaries of a single generalising theorem. In addition our characterisation covers combinations of these, as well as new criteria, notably, link labelings.