N. Agmon and D. Peleg, Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1070-1078, 2004.
DOI : 10.1137/050645221

D. Angluin, Local and global properties in networks of processors (Extended Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing , STOC '80, pp.82-93, 1980.
DOI : 10.1145/800141.804655

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, PODC, pp.290-299, 2004.
DOI : 10.1007/s00446-005-0138-3

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, Distributed Computing, pp.235-253, 2006.
DOI : 10.1007/s00446-005-0138-3

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing Population Protocols, Principles of Distributed Systems; 9th International Conference, pp.103-117, 2005.
DOI : 10.1007/3-540-44681-8_67

J. Beauquier, T. Herault, and E. Schiller, Easy Stabilization with an Agent, 5th Workshop on Self-Stabilizing Systems (WSS), pp.35-51
DOI : 10.1007/3-540-45438-1_3

A. Kumar-datta, M. Gradinariu, and M. Raynal, Stabilizing mobile philosophers, Information Processing Letters, vol.95, issue.1, pp.299-306, 2005.
DOI : 10.1016/j.ipl.2005.03.006

X. Défago and M. Gradinariu, Stéphane Messika, and Philippe Raipin Parvédy. Fault-tolerant and self-stabilizing mobile robots gathering, DISC, pp.46-60, 2006.

A. Dessmark, P. Fraigniaud, D. R. Kowalski, and A. Pelc, Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006.
DOI : 10.1007/s00453-006-0074-2

S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, Searching for a black hole in arbitrary networks, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.153-161, 2002.
DOI : 10.1145/571825.571853

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.2514/1.10141
URL : https://hal.archives-ouvertes.fr/inria-00627780

S. Dolev, E. Schiller, and J. Welch, Random walk for self-stabilizing group communication in ad-hoc networks. Reliable Distributed Systems, Proceedings . 21st IEEE Symposium on, pp.70-79, 2002.

U. Feige, A tight upper bound on the cover time for random walks on graphs, Random Structures & Algorithms, vol.4, issue.1, pp.51-54, 1995.
DOI : 10.1002/rsa.3240060106

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Distributed coordination of a set of autonomous mobile robots, Proceedings of the IEEE Intelligent Vehicles Symposium 2000 (Cat. No.00TH8511), pp.480-485, 2000.
DOI : 10.1109/IVS.2000.898389

V. Fedor, P. Fomin, N. Fraigniaud, and . Nisse, Nondeterministic graph searching: From pathwidth to treewidth, MFCS, pp.364-375, 2005.

P. Fraigniaud, D. Ilcinkas, S. Rajsbaum, and S. Tixeuil, The Reduced Automata Technique for Graph Exploration Space Lower Bounds, Essays in Memory of Shimon Even, pp.1-26, 2006.
DOI : 10.1007/11685654_1
URL : https://hal.archives-ouvertes.fr/hal-00341655

S. Ghosh, Agents, Distributed Algorithms, and Stabilization, Computing and Combinatorics (COCOON, pp.242-251, 2000.
DOI : 10.1007/3-540-44968-X_24

T. Herman and T. Masuzawa, Self-Stabilizing Agent Traversal, WSS01 Proceedings of the Fifth International Workshop on Self-Stabilizing Systems, pp.152-166, 2001.
DOI : 10.1007/3-540-45438-1_11

G. Prencipe, Corda: Distributed coordination of a set of autonomous mobile robots, Proc. ERSADS, pp.185-190, 2001.

I. Suzuki and M. Yamashita, Distributed anonymous mobile robots?formation and agreement problems, Proceedings of the 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO '96), 1996.

P. Tetali and P. Winkler, On a random walk problem arising in selfstabilizing token management, PODC, pp.273-280, 1991.

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.90-96, 1996.
DOI : 10.1145/62546.62568

I. Unité-de-recherche, . Lorraine, . Loria, and . Technopôle-de-nancy, Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche INRIA Sophia Antipolis : 2004, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex