We investigate the computability of distributed tasks in reliable anonymous networks with arbitrary knowledge. More precisely, we consider tasks computable with local termination, i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study weak local termination,… (More)
The 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 in the asyn-chronous message passing model. The characterisation encompasses all criteria that have been formulated in the past that were known to influence explicit… (More)
Graph relabelling systems have been introduced as a suitable model for expressing and studying distributed algorithms on a network of communicating processors. We recall the basic ideas underlying that model and we survey the main questions that have been considered and the main results that have been obtained in that framework.