, DESCARTES (ANR-16-CE40-0023) This study has been carried out in the frame of the " Investments for the future, Programme IdEx Bordeaux ? CPU

C. Ambühl, L. Gasieniec, A. Pelc, T. Radzik, and X. Zhang, Tree exploration with logarithmic memory, ACM Transactions on Algorithms, vol.7, issue.2, pp.1-1721, 2011.
DOI : 10.1145/1921659.1921663

L. Blin, P. Fraigniaud, N. Nisse, and S. Vial, Distributed chasing of network intruders, Theoretical Computer Science, vol.399, issue.1-2, pp.12-37, 2008.
DOI : 10.1016/j.tcs.2008.02.004
URL : https://hal.archives-ouvertes.fr/hal-01311355

P. Boldi and S. Vigna, An Effective Characterization of Computability in Anonymous Networks, DISC 2001, pp.33-47, 2001.
DOI : 10.1007/3-540-45414-4_3

P. Boldi and S. Vigna, Universal dynamic synchronous self-stabilization, Distributed Computing, vol.15, issue.3, pp.137-153, 2002.
DOI : 10.1007/s004460100062

K. Censor-hillel, E. Fischer, G. Schwartzman, and Y. Vasudev, Fast Distributed Algorithms for Testing Graph Properties, DISC 2016, pp.43-56, 2016.

J. Chalopin, E. Godard, and Y. Métivier, Local Terminations and Distributed Computability in Anonymous Networks, DISC 2008, pp.47-62, 2008.
DOI : 10.1007/978-3-540-87779-0_4
URL : https://hal.archives-ouvertes.fr/hal-00332759

J. Chalopin, E. Godard, Y. Métivier, and G. Tel, About the Termination Detection in the Asynchronous Message Passing Model, SOFSEM 2007, pp.200-211, 2007.
DOI : 10.1007/978-3-540-69507-3_16
URL : https://hal.archives-ouvertes.fr/hal-00308126

T. D. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647

S. Das, Mobile agents in distributed computing: Network exploration, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, vol.109, pp.54-69, 2013.

S. Das, S. Kutten, and Z. Lotker, Distributed Verification Using Mobile Agents, ICDCN 2013, pp.330-347, 2013.
DOI : 10.1007/978-3-642-35668-1_23

D. Sarma, A. Holzer, S. Kor, L. Korman, A. Nanongkai et al., Distributed Verification and Hardness of Distributed Approximation, SIAM Journal on Computing, vol.41, issue.5, pp.1235-1265, 2012.
DOI : 10.1137/11085178X

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.1-18, 2006.
DOI : 10.1145/571825.571853

Y. Emek, C. Pfister, J. Seidel, and R. Wattenhofer, Anonymous networks, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.96-105, 2014.
DOI : 10.1145/2611462.2611478

L. Feuilloley and P. Fraigniaud, Survey of Distributed Decision. Bulletin of the EATCS, vol.119, 2016.

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

P. Fraigniaud, M. Göös, A. Korman, and J. Suomela, What can be decided locally without identifiers?, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.157-165, 2013.
DOI : 10.1145/2484239.2484264
URL : https://hal.archives-ouvertes.fr/hal-00912527

P. Fraigniaud, M. M. Halldórsson, and A. Korman, On the Impact of Identifiers on Local Decision, OPODIS 2012, pp.224-238, 2012.
DOI : 10.1007/978-3-642-35476-2_16
URL : https://hal.archives-ouvertes.fr/hal-01241093

P. Fraigniaud, A. Korman, and D. Peleg, Towards a complexity theory for local distributed computing, Journal of the ACM, vol.60, issue.5, p.35, 2013.
DOI : 10.1145/2499228

P. Fraigniaud and A. Pelc, Decidability classes for mobile agents computing, Journal of Parallel and Distributed Computing, vol.109, pp.117-128, 2017.
DOI : 10.1016/j.jpdc.2017.04.003
URL : https://hal.archives-ouvertes.fr/hal-01674623

P. Fraigniaud, S. Rajsbaum, T. , and C. , Locality and checkability in wait-free computing, Distributed Computing, vol.15, issue.4, pp.223-242, 2013.
DOI : 10.1007/BF01961540
URL : https://hal.archives-ouvertes.fr/hal-00605244

M. Göös and J. Suomela, Locally Checkable Proofs in Distributed Computing, Theory of Computing, vol.12, issue.1, pp.1-33, 2016.

M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

A. Korman, S. Kutten, and D. Peleg, Proof labeling schemes, Distributed Computing, vol.34, issue.2, pp.215-233, 2010.
DOI : 10.1007/s00446-010-0095-3

D. B. Lange and M. Oshima, Seven good reasons for mobile agents, Communications of the ACM, vol.42, issue.3, pp.88-89, 1999.
DOI : 10.1145/295685.298136

E. Markou, Identifying hostile nodes in networks using mobile agents, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, vol.108, pp.93-129, 2012.

M. Naor, M. Stockmeyer, and L. J. , What Can be Computed Locally?, SIAM Journal on Computing, vol.24, issue.6, pp.1259-1277, 1995.
DOI : 10.1137/S0097539793254571

A. Pelc, Deterministic rendezvous in networks: A comprehensive survey, Networks, vol.7, issue.3, pp.331-347, 2012.
DOI : 10.1109/71.481599

M. Yamashita and T. Kameda, Computing functions on asynchronous anonymous networks, Mathematical Systems Theory, vol.7, issue.1, pp.331-356, 1996.
DOI : 10.1145/48014.48247