A. Basu, B. Charron-bost, and S. Toueg, Crash failures vs. crash + link failures, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing , PODC '96, 1996.
DOI : 10.1145/248052.248102

B. Awerbuch, Complexity of network synchronization, Journal of the ACM, vol.32, issue.4, pp.804-823, 1985.
DOI : 10.1145/4221.4227

J. Widder and U. Schmid, The Theta-Model: achieving synchrony without clocks, Distributed Computing, vol.20, issue.2, pp.29-47, 2009.
DOI : 10.1007/s00446-009-0080-x

M. Függer, A. Kößler, T. Nowak, U. Schmid, and M. Zeiner, The Effect of Forgetting on the Performance of a Synchronizer, Algorithms for Sensor Systems, pp.185-200, 2014.

E. F. Nakamura, A. A. Loureiro, and A. C. Frery, Information fusion for wireless sensor networks, ACM Computing Surveys, vol.39, issue.3
DOI : 10.1145/1267070.1267073

K. Marzullo, Tolerating failures of continuous-valued sensors, ACM Transactions on Computer Systems, vol.8, issue.4, pp.284-304, 1990.
DOI : 10.1145/128733.128735

U. Schmid and K. Schossmaier, How to reconcile fault-tolerant interval intersection with the Lipschitz condition, Distributed Computing, vol.14, issue.2, pp.101-111, 2001.
DOI : 10.1007/PL00008927

J. Y. Halpern, Using Reasoning About Knowledge to Analyze Distributed Systems, Annual Review of Computer Science, vol.2, issue.1, pp.37-68, 1987.
DOI : 10.1146/annurev.cs.02.060187.000345

R. Fagin and J. Y. Halpern, Reasoning about knowledge and probability, Journal of the ACM, vol.41, issue.2, pp.340-367, 1994.
DOI : 10.1145/174652.174658
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.8779

M. Jayaram and G. Varghese, Crash failures can drive protocols to arbitrary states, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing , PODC '96, pp.247-256, 1996.
DOI : 10.1145/248052.248104

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

D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation, 1989.

S. Rajsbaum, Upper and lower bounds for stochastic marked graphs, Information Processing Letters, vol.49, issue.6, pp.291-295, 1994.
DOI : 10.1016/0020-0190(94)90102-3

S. Rajsbaum and M. Sidi, On the performance of synchronized programs in distributed networks with random processing times and transmission delays, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.9, pp.939-950, 1994.
DOI : 10.1109/71.308532

T. Nowak, M. Függer, and A. Kößler, On the performance of a retransmission-based synchronizer, Theoretical Computer Science, vol.509, pp.25-39, 2013.
DOI : 10.1016/j.tcs.2012.04.035
URL : https://hal.archives-ouvertes.fr/hal-00993805

J. G. Propp and D. B. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures and Algorithms, vol.9, issue.1-2, pp.223-252, 1996.
DOI : 10.1002/(SICI)1098-2418(199608/09)9:1/2<223::AID-RSA14>3.0.CO;2-O

P. Kirschenhofer and H. Prodinger, Ein Ergebnis der Ordnungsstatistik mit Anwendung auf probabilistischs Z??hlen, Computing, vol.43, issue.1, pp.15-27, 1993.
DOI : 10.1007/BF02243826

W. Szpankowski and V. Rego, Yet another application of a binomial recurrence, Order statistics, Computing, pp.401-410, 1990.

S. Meyn and R. L. Tweedie, Markov chains and stochastic stability, 2009.

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Computers in Physics, vol.3, issue.5, 1989.
DOI : 10.1063/1.4822863