D. Angluin, Local and global properties in networks of processors, 12 th Symposium on theory of computing, p.8293, 1980.

M. Bauderon, Y. Métivier, M. Mosbah, and A. Sellami, From local computations to asynchronous message passing systems, pp.1271-1273, 2002.

M. Bauderon and M. Mosbah, A unied framework for designing, implementing and visualizing distributed algorithms, Graph Transformation and Visual Modeling Techniques (GT-VMT'02), 2003.

J. Chalopin, E. Godard, Y. Métivier, and R. Ossamy, Mobile Agent Algorithms Versus Message Passing Algorithms, 10th International Conference On Principles Of Distributed Systems (OPODIS'06), volume 4305 of Lecture notes in computer science, p.187201, 2006.
DOI : 10.1007/11945529_14
URL : https://hal.archives-ouvertes.fr/hal-00308127

J. Chalopin and D. Paulusma, Graph Labelings Derived from Models in Distributed Computing, 32 th International Workshop on Graph-Theoretic Concepts in Computer Science, p.301312, 2006.
DOI : 10.1007/11917496_27
URL : https://hal.archives-ouvertes.fr/hal-00308129

S. Gruner, Mobile agent systems and cellular automata, Autonomous Agents and Multi-Agent Systems, vol.21, issue.1, 2006.
DOI : 10.1007/s10458-009-9090-0

A. E. Hibaoui, Y. Métivier, J. Robson, N. Saheb-djahromi, and A. Zemmari, Analysis of a randomized dynamic timetable handshake algorithm, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307794

P. Knirsch and H. Kreowski, A Note on Modeling Agent Systems by Graph Transformation, Applications of Graph Transformations with Industrial Relevance (AGTIVE'99), volume 1779 of Lecture notes in computer science, p.7986, 2000.
DOI : 10.1007/3-540-45104-8_6

I. Litovsky, Y. Métivier, and E. Sopena, Dierent local controls for graph relabelling systems, Math. Syst. Theory, vol.28, p.4165, 1995.
DOI : 10.1007/bf01294595

I. Litovsky, Y. Métivier, and E. Sopena, GRAPH RELABELLING SYSTEMS AND DISTRIBUTED ALGORITHMS
DOI : 10.1142/9789812814951_0001
URL : https://hal.archives-ouvertes.fr/hal-00307042

I. H. Ehrig, H. Kreowski, U. Montanari, and G. Rozenberg, Handbook of graph grammars and computing by graph transformation, World Scientic, vol.3, p.156, 1999.

I. Litovsky, Y. Métivier, and W. Zielonka, On the Recognition of Families of Graphs with Local Computations, Information and Computation, vol.118, issue.1, p.110119, 1995.
DOI : 10.1006/inco.1995.1056
URL : https://hal.archives-ouvertes.fr/hal-00307044

Y. Métivier, N. Saheb, and A. Zemmari, Randomized rendez vous Mathematics and computer science: Algorithms, trees, combinatorics and probabilities, Trends in mathematics, Birkhäuser, p.183194, 2000.

Y. Métivier, N. Saheb, and A. Zemmari, Randomized local elections, Information Processing Letters, vol.82, issue.6, p.313120, 2002.
DOI : 10.1016/S0020-0190(01)00289-7

Y. Métivier, N. Saheb, and A. Zemmari, Analysis of a randomized rendez vous algorithm, Information and Computation, vol.184, p.109128, 2003.

R. Ossamy, An algorithmic and computational approach to local computations, 2005.

I. Centre-de-recherche and . Futurs, Parc Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex Centre de recherche INRIA Nancy ? Grand Est : LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615

. Centre-de-recherche-inria-rennes-?-bretagne-atlantique, IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex Centre de recherche INRIA Grenoble ? Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier Centre de recherche INRIA Paris ? Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex Centre de recherche INRIA Sophia Antipolis ? Méditerranée : 2004, route des Lucioles -BP 93 -06902, 105 -78153 Le Chesnay Cedex (France