Y. Afek, N. Alon, Z. Bar-joseph, A. Cornejo, B. Haeupler et al., Beeping a maximal independent set, Distributed Computing, vol.26, issue.4, pp.195-208, 2012.

D. Aldous and J. A. Fill, Lower bounds for covering times for reversible Markov chains and random walks on graphs, Journal of Theoretical Probability, vol.2, issue.1, pp.91-100, 1989.

D. Alistarh, J. Aspnes, and R. Gelashvili, Space-Optimal Majority in Population Protocols, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.2221-2239, 2018.

T. Amir, J. Aspnes, D. Doty, M. Eftekhari, and E. E. Severson, Message complexity of population protocols, International Symposium on Distributed Computing, DISC, vol.6, pp.1-6, 2020.

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

D. Angluin, J. Aspnes, and D. Eisenstat, A simple population protocol for fast robust approximate majority, Distributed Computing, vol.21, issue.2, pp.87-102, 2008.

D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distributed Computing, vol.20, issue.4, pp.279-304, 2007.

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing population protocols, ACM Transactions on Autonomous and Adaptive Systems, vol.3, issue.4, pp.1-28, 2008.

A. Arora, S. Dolev, and M. G. Gouda, MAINTAINING DIGITAL CLOCKS IN STEP, Parallel Processing Letters, vol.01, issue.01, pp.11-18, 1991.

L. Becchetti, A. E. Clementi, E. Natale, F. Pasquale, and R. Silvestri, Plurality Consensus in the Gossip Model, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.371-390, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02002629

L. Becchetti, A. E. Clementi, E. Natale, F. Pasquale, and L. Trevisan, Stabilizing Consensus with Many Opinions, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.620-635, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02002615

M. Ben-or, D. Dolev, and E. N. Hoch, Fast self-stabilizing byzantine tolerant digital clock synchronization, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08, pp.385-394, 2008.

P. Berenbrink, A. E. Clementi, R. Elsässer, P. Kling, F. Mallmann-trenn et al., Ignore or Comply?, Proceedings of the ACM Symposium on Principles of Distributed Computing, pp.335-344, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02002544

L. Boczkowski, A. Korman, and E. Natale, Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.2540-2559, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01447435

L. Boczkowski, A. Korman, and E. Natale, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Distributed Computing, vol.32, issue.3, pp.173-191, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01447435

C. Boulinier, F. Petit, and V. Villain, Synchronous vs. Asynchronous Unison, Algorithmica, vol.51, issue.1, pp.61-80, 2007.

B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, Stabilizing consensus with the power of two choices, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11, pp.149-158, 2011.

D. Dolev, K. Heljanko, M. Järvisalo, J. H. Korhonen, C. Lenzen et al., Synchronous counting and computational algorithm design, Journal of Computer and System Sciences, vol.82, issue.2, pp.310-332, 2016.

D. Dolev and E. N. Hoch, On Self-stabilizing Synchronous Actions Despite Byzantine Attacks, Lecture Notes in Computer Science, pp.193-207

D. Dolev and R. Reischuk, Bounds on information exchange for Byzantine agreement, Journal of the ACM, vol.32, issue.1, pp.191-204, 1985.

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of Byzantine faults, Journal of the ACM, vol.51, issue.5, pp.780-799, 2004.

B. Dudek and A. Kosowski, Universal protocols for information dissemination using emergent signals, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, pp.87-99, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01503359

Y. Emek and R. Wattenhofer, Stone age distributed computing, Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13, pp.137-146, 2013.

O. Feinerman, B. Haeupler, and A. Korman, Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication, Distributed Computing, vol.30, issue.5, pp.339-355, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01672280

M. Feldmann, A. Khazraei, and C. Scheideler, Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pp.223-233, 2020.

L. G?sieniec and G. Stachowiak, Fast Space Optimal Leader Election in Population Protocols, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.2653-2667, 2018.

M. Ghaffari and J. Lengler, Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp.305-313, 2018.

M. G. Gouda and T. Herman, Stabilizing unison, Information Processing Letters, vol.35, issue.4, pp.171-175, 1990.

R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.565-574

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

A. Kosowski and P. Uznanski, Brief Announcement, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01415072

C. Lenzen and J. Rybicki, Near-optimal self-stabilising counting and firing squads, Distributed Computing, vol.32, issue.4, pp.339-360, 2018.

C. Lenzen, J. Rybicki, and J. Suomela, Efficient Counting with Optimal Resilience, SIAM Journal on Computing, vol.46, issue.4, pp.1473-1500, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01199803

T. M. Liggett, Interacting Particle Systems, 1985.

R. E. Mirollo and S. H. Strogatz, Synchronization of Pulse-Coupled Biological Oscillators, SIAM Journal on Applied Mathematics, vol.50, issue.6, pp.1645-1662, 1990.