D. Angluin, J. Aspnes, M. Chan, H. Jiang, M. J. Fischer et al., Stably Computable Properties of Network Graphs, DCOSS, pp.63-74, 2005.
DOI : 10.1007/11502593_8

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.

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, DC, vol.18, issue.4, pp.235-253, 2006.

D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distributed Computing, vol.34, issue.3, pp.279-304, 2007.
DOI : 10.1007/s00446-007-0040-2

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing population protocols, TAAS, vol.3, issue.4, 2008.
DOI : 10.1007/11795490_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.589

M. Fischer and H. Jiang, Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents, OPODIS, pp.395-409, 2006.
DOI : 10.1007/11945529_28

T. Herman, Adaptivity through Distributed Convergence, 1991.

M. O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, p.114, 1959.
DOI : 10.1147/rd.32.0114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4472

G. Tel, Introduction to Distributed Algorithms, 2000.
DOI : 10.1017/CBO9781139168724