Y. Afek, B. Awerbuch, S. A. Plotkin, and M. E. Saks, Local management of a global resource in a communication network, Symposium on Foundations of Computer Science, pp.347-357, 1987.

J. Allouche and J. O. Shallit, Automatic Sequences -Theory, Applications, Generalizations, 2003.

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

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, ACM Trans. Auton. Adapt. Syst, vol.3, issue.4, 2008.
DOI : 10.1007/11795490_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.589

C. Baquero, P. S. Almeida, R. Menezes, and P. Jesus, Extrema Propagation: Fast Distributed Estimation of Sums and Network Sizes, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.4, pp.668-675, 2012.
DOI : 10.1109/TPDS.2011.209

J. Beauquier, J. Burman, and S. Clavì-ere, Comptage et nommage simples et efficaces dans les protocoles de populations symétriques, ALGOTEL 2014, pp.1-4, 2014.

J. Beauquier, J. Clement, S. Messika, L. Rosaz, and B. Rozoy, Self-stabilizing Counting in Mobile Sensor Networks with a Base Station, DISC, pp.63-76, 2007.
DOI : 10.1007/978-3-540-75142-7_8

O. Bournez, J. Chalopin, J. Cohen, and X. Koegler, Playing With Population Protocols, CSP, pp.3-15, 2008.
DOI : 10.4204/EPTCS.1.1
URL : https://hal.archives-ouvertes.fr/inria-00330344

S. Dolev, M. G. Gouda, and M. Schneider, Memory requirements for silent stabilization, Acta Informatica, vol.36, issue.6, pp.447-462, 1999.
DOI : 10.1007/s002360050180

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Computing, vol.15, issue.7, pp.3-16, 1993.
DOI : 10.1007/BF02278851

Y. Emek and A. Korman, New bounds for the controller problem, DISC, pp.22-34, 2009.

P. Fraigniaud, A. Pelc, D. Peleg, and S. Perennes, Assigning labels in an unknown anonymous network with a leader, Distributed Computing, vol.14, issue.3, pp.163-183, 2001.
DOI : 10.1007/PL00008935

A. J. Ganesh, A. Kermarrec, E. L. Merrer, and L. Massoulié, Peer counting and sampling in overlay networks based on random walks, Distributed Computing, vol.88, issue.5, pp.267-278, 2007.
DOI : 10.1007/s00446-007-0027-z
URL : https://hal.archives-ouvertes.fr/inria-00331603

C. Gkantsidis, M. Mihail, and A. Saberi, Random walks in peer-to-peer networks: Algorithms and evaluation, Performance Evaluation, vol.63, issue.3, pp.241-263, 2006.
DOI : 10.1016/j.peva.2005.01.002

A. M. Hinz, S. Klavzar, U. Milutinovic, and C. Petr, The Tower of Hanoi -Myths and Maths, Birkhäuser Basel, p.9783034802369, 2013.
DOI : 10.1007/978-3-0348-0237-6

T. Izumi, K. Kinpara, T. Izumi, and K. Wada, Space-efficient self-stabilizing counting population protocols on mobile sensor networks, Theoretical Computer Science, vol.552, pp.99-108, 2014.
DOI : 10.1016/j.tcs.2014.07.028

H. Jiang, Distributed Systems of Simple Interacting Agents, 2007.

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.482-491, 2003.
DOI : 10.1109/SFCS.2003.1238221

A. Korman and S. Kutten, Controller and estimator for dynamic networks, Information and Computation, vol.223, pp.43-66, 2013.
DOI : 10.1016/j.ic.2012.10.018
URL : https://hal.archives-ouvertes.fr/hal-00912550

D. Kostoulas, D. Psaltoulis, I. Gupta, K. P. Birman, and A. J. Demers, Active and passive techniques for group size estimation in large-scale and dynamic distributed systems, Journal of Systems and Software, vol.80, issue.10, pp.1639-1658, 2007.
DOI : 10.1016/j.jss.2007.01.014

F. Kuhn, N. A. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.513-522, 2010.
DOI : 10.1145/1806689.1806760

G. , D. Luna, R. Baldoni, S. Bonomi, and I. Chatzigiannakis, Conscious and unconscious counting on anonymous dynamic networks, ICDCN, pp.257-271, 2014.

G. , D. Luna, R. Baldoni, S. Bonomi, and I. Chatzigiannakis, Counting in anonymous dynamic networks under worst-case adversary, ICDCS, pp.338-347, 2014.

E. , L. Merrer, A. Kermarrec, and L. Massoulié, Peer to peer size estimation in large and dynamic networks: A comparative study, HPDC, pp.7-17, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070184

O. Michail, I. Chatzigiannakis, and P. G. Spirakis, Naming and Counting in Anonymous Unknown Dynamic Networks, SSS, pp.281-295, 2013.
DOI : 10.1007/978-3-319-03089-0_20

D. Mosk-aoyama and D. Shah, Computing separable functions via gossip, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.113-122, 2006.
DOI : 10.1145/1146381.1146401

B. F. Ribeiro and D. F. Towsley, Estimating and sampling graphs with multidimensional random walks, Proceedings of the 10th annual conference on Internet measurement, IMC '10, pp.390-403, 2010.
DOI : 10.1145/1879141.1879192

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

D. Varagnolo, G. Pillonetto, and L. Schenato, Distributed statistical estimation of the number of nodes in sensor networks, 49th IEEE Conference on Decision and Control (CDC), pp.1498-1503, 2010.
DOI : 10.1109/CDC.2010.5717355