Graph relabelling systems have been introduced as a suitable model for
expressing and studying distributed algorithms on a network of commun
icating processors. We recall the basic ideas underlying that model an
d we survey the main questions that have been considered and the main
results that have been obtained in that framework.