M. K. Aguilera, C. Delporte-gallet, H. Fauconnier, and S. Toueg, Consensus with Byzantine Failures and Little System Synchrony, International Conference on Dependable Systems and Networks (DSN'06), pp.147-155, 2006.
DOI : 10.1109/DSN.2006.22
URL : https://hal.archives-ouvertes.fr/hal-00154870

H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004.
DOI : 10.1002/0471478210

M. Ben-or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, 2nd ACM Symposium on Principles of Distributed Comput- ing(PODC'83), pp.27-30, 1983.

C. Ch, K. Kursawe, and V. Shoup, Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography, Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC'00), pp.123-132, 2000.

T. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647

C. Delporte-gallet, S. Devismes, H. Fauconnnier, and M. Larrea, Algorithms for Extracting Timeliness Graphs, 17th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'10), pp.127-141, 2010.
DOI : 10.1007/978-3-642-13284-1_11
URL : https://hal.archives-ouvertes.fr/hal-00454388

A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper, Muteness Failure Detectors: Specification and Implementation, Proc. 3rd European Dependable Computing Conference (EDCC'99 Springer-Verlag LNCS #1667, pp.71-87, 1999.
DOI : 10.1007/3-540-48254-7_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.4790

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

M. J. Fischer, N. A. Lynch, and M. S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

R. Friedman, A. Mostéfaoui, and M. Raynal, 3Pmute-Based Consensus for Asynchronous Byzantine Systems, Parallel Processing Letters, pp.162-182, 2005.

R. Friedman, A. Mostéfaoui, and M. Raynal, Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems, IEEE Transactions on Dependable and Secure Computing, pp.46-56, 2005.
DOI : 10.1109/TDSC.2005.13

M. Hamouna, A. Mostéfaoui, and G. Trédan, Byzantine Consensus with Few Synchronous Links, 11th Conference on Principles of Distributed Systems (OPODIS'07), pp.76-89, 2007.

M. Hamouna, A. Mostéfaoui, and G. Trédan, Byzantine Consensus in Signature-free Systems

L. Lamport, R. Shostack, 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

N. A. Lynch, Distributed Algorithms, 1996.

K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-smith, Byzantine Fault Detectors for Solving Consensus, The Computer Journal, vol.46, issue.1, pp.16-35, 2003.
DOI : 10.1093/comjnl/46.1.16

M. Pease, R. Shostak, R. Lamport, and L. , Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980.
DOI : 10.1145/322186.322188

M. Raynal, Fault-tolerant Agreement in Synchronous Message-passing Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00294ED1V01Y201009DCT003
URL : https://hal.archives-ouvertes.fr/inria-00543049