N. A. Lynch, Distributed Algorithms, 1996.

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

O. Bakr and I. Keidar, Evaluating the running time of a communication round over the internet, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, 2002.
DOI : 10.1145/571825.571864

B. Charron-bost and A. Schiper, The Heard-Of model: computing in distributed systems with benign faults, Distributed Computing, vol.384, issue.3, pp.49-71, 2009.
DOI : 10.1007/s00446-009-0084-6

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

L. Lamport, R. Shostak, and M. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

F. B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys, vol.22, issue.4, pp.22-299, 1990.
DOI : 10.1145/98163.98167

J. A. Resing, R. E. De-vries, G. Hooghiemstra, M. S. Keane, and G. J. Olsder, Asymptotic behavior of random discrete event systems, Stochastic Process, Appl, pp.36-195, 1990.

T. Nowak, M. Függer, and A. Kößler, On the performance of a retransmission-based synchronizer, 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.234-245, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00993805

C. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988.
DOI : 10.1145/42282.42283

G. Neiger and S. Toueg, Automatically increasing the fault-tolerance of distributed algorithms, Journal of Algorithms, vol.11, issue.3, pp.374-419, 1990.
DOI : 10.1016/0196-6774(90)90019-B

M. Ben-or, Another advantage of free choice: completely asynchronous agreement protocols, 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), 1983.

G. Bracha and S. Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM, vol.32, issue.4, pp.824-840, 1985.
DOI : 10.1145/4221.214134
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.8693

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

D. P. Bertsekas and J. N. , Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, 1989.

B. Heidergott, Max-Plus Linear Stochastic Systems and Perturbation Analysis, 2006.
DOI : 10.1007/978-0-387-38995-0

F. Baccelli and D. Hong, Analytic expansions of max-plus Lyapunov exponents, The Annals of Applied Probability, vol.10, issue.3, pp.779-827, 2000.
DOI : 10.1214/aoap/1019487510