I. Abraham, G. V. Chockler, I. Keidar, and D. Malkhi, Byzantine disk paxos, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04
DOI : 10.1145/1011767.1011801

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 O. Rachman, ) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998.
DOI : 10.1137/S0097539795279463

V. C. Barbosa and E. Gafni, Concurrency in heavily loaded neighborhood-constrained systems, ACM Transactions on Programming Languages and Systems, vol.11, issue.4, pp.562-584, 1989.
DOI : 10.1145/69558.69560

M. Ben-or, Another advantage of free choice (Extended Abstract), Proceedings of the second annual ACM symposium on Principles of distributed computing , PODC '83, pp.27-30, 1983.
DOI : 10.1145/800221.806707

V. Francisco, F. Brasileiro, A. Greve, M. Mostéfaoui, and . Raynal, Consensus in one communication step, PaCT '01 : Proceedings of the 6th International Conference on Parallel Computing Technologies, pp.42-50, 2001.

C. Busch, S. Surapaneni, and S. Tirthapura, Analysis of link reversal routing algorithms for mobile ad hoc networks, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '03, pp.210-219, 2003.
DOI : 10.1145/777412.777446

C. Busch and S. Tirthapura, Analysis of Link Reversal Routing Algorithms, SIAM Journal on Computing, vol.35, issue.2, pp.305-326, 2005.
DOI : 10.1137/S0097539704443598

M. Castro and B. Liskov, Practical byzantine fault tolerance and proactive recovery, ACM Transactions on Computer Systems, vol.20, issue.4, pp.398-461, 2002.
DOI : 10.1145/571637.571640

T. Deepak, C. , and S. Toueg, Unreliable failure detectors for reliable distributed systems, J. ACM, vol.43, issue.2, pp.225-267, 1996.

K. M. Chandy and J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems, vol.6, issue.4, pp.632-646, 1984.
DOI : 10.1145/1780.1804

B. Charron-bost, A. Gaillard, M. Biely, M. Hutle, A. Schiper et al., Tolerating corrupted communication, PODC '07 : Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp.244-253, 2007.

B. Charron-bost, A. Gaillard, J. L. Welch, and J. Widder, Routing without ordering. (under submission, 2008.

B. Charron-bost, R. Guerraoui, and A. Schiper, Synchronous system and perfect failure detector: Solvability and efficiency issues, Proceeding International Conference on Dependable Systems and Networks. DSN 2000, pp.523-532, 2000.
DOI : 10.1109/ICDSN.2000.857585

B. Charron-bost and A. Schiper, Improving Fast Paxos: being optimistic with no overhead, 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06), pp.287-295, 2006.
DOI : 10.1109/PRDC.2006.39

B. Charron-bost and A. Schiper, The Heard-Of Model : Computing in Distributed Systems with Benign Failures, 2006.

D. Dolev, C. Dwork, and L. Stockmeyer, On the minimal synchronism needed for distributed consensus, Journal of the ACM, vol.34, issue.1, pp.77-97, 1987.
DOI : 10.1145/7531.7533

C. Dwork, N. A. 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

F. Fich, How Hard Is It to Take a Snapshot?, Proceedings of 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), pp.28-37, 2005.
DOI : 10.1007/978-3-540-30577-4_3

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

E. Gafni, Rounds-by-rounds fault detectors : unifying synchrony and asynchrony, Proceedings of the Seventeenth ACM Symposium on Principles of Distributed Computing, pp.143-152, 1998.
DOI : 10.1145/277697.277724

E. Gafni and D. Bertsekas, Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology, IEEE Transactions on Communications, vol.29, issue.1, pp.11-18, 1981.
DOI : 10.1109/TCOM.1981.1094876

A. Gaillard, Communication predicates for atomic registers sharedmemory . (under submission), 2008.

M. P. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.123-149, 1991.
DOI : 10.1145/114005.102808

C. P. Kruskal, L. Rudolph, and M. Snir, Efficient synchronization of multiprocessors with shared memory, ACM Transactions on Programming Languages and Systems, vol.10, issue.4, pp.579-601, 1988.
DOI : 10.1145/48022.48024

L. Lamport, On interprocess communication. part ii : Algorithms. Distributed Computing, pp.86-101, 1986.

L. Lamport, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229

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

B. Lampson, The ABCD's of Paxos, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, 2001.
DOI : 10.1145/383962.383969

D. Lehmann, M. O. Malka, S. Moran, and S. Zaks, On the advantages of free choice : a symmetric and fully distributed solution to the dining philosophers problem, POPL '81 : Proceedings of the 8th ACM SIGPLAN- SIGACT symposium on Principles of programming languages ACM. [33] N. A. Lynch. Distributed Algorithms, pp.133-138383, 1981.

N. Malpani, J. Welch, and N. Vaidya, Leader election algorithms for mobile ad hoc networks, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '00, pp.966-103, 2000.
DOI : 10.1145/345848.345871

J. Martin, Fast Byzantine Consensus, IEEE Transactions on Dependable and Secure Computing, vol.3, issue.3, pp.202-215, 2006.
DOI : 10.1109/TDSC.2006.35

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. D. Park and M. S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, Proceedings of INFOCOM '97, pp.1405-1413, 1997.
DOI : 10.1109/INFCOM.1997.631180

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

F. Pedone, A. Schiper, P. Urbán, and D. Cavin, Solving Agreement Problems with Weak Ordering Oracles, EDCC-4 : Proceedings of the 4th European Dependable Computing Conference on Dependable Computing, pp.44-61, 2002.
DOI : 10.1007/3-540-36080-8_5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

O. Michael and . Rabin, Theoretical impediments to artificial intelligence, IFIP Congress, pp.615-619, 1974.

K. Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems, vol.7, issue.1, pp.61-77, 1989.
DOI : 10.1145/58564.59295

N. Santoro and P. Widmayer, Time is not a healer, Proceedings of the 6th Symposium on Theor, pp.304-313, 1989.
DOI : 10.1007/BFb0028994

U. Schmid, B. Weiss, and J. Rushby, Formally verified Byzantine agreement in presence of link faults, Proceedings 22nd International Conference on Distributed Computing Systems, p.608, 2002.
DOI : 10.1109/ICDCS.2002.1022311

T. K. Srikanth and S. Toueg, Simulating authenticated broadcasts to derive simple fault-tolerant algorithms, Distributed Computing, pp.80-94, 1987.
DOI : 10.1007/BF01667080

URL : http://ecommons.cornell.edu/bitstream/1813/6462/1/84-623.pdf

J. Walter, G. Cao, and M. Mohanty, A k-mutual exclusion algorithm for wireless ad hoc networks, Proceedings of the ACM Workshop on Principles of Mobile Computing (POMC), 2001.

J. Walter, J. L. Welch, and N. Vaidya, A mutual exclusion algorithm for ad hoc mobile networks, Wireless Networks, vol.7, issue.6, pp.585-600, 2001.
DOI : 10.1023/A:1012363200403

P. Zieli´nskizieli´nski, Paxos at war, 2004.

H. Machines and E. , 14 1.2.1 Machines

.. Translations-dans-le-cas-bénin, 20 1.3.1 Translations uniformes, p.22

.. Mémoire-partagée-dans-le-cas-bénin, 24 2.1.1 Registres SWMR et objets Atomic-Snapshot, p.54

.. Prédicats-pour-le-consensus-cas-bénin, 86 2.3.1 Caractérisation des machines HO qui résolvent Consensus

.. Orientation-vers-la-destination, 160 4.2.1 Notations, 160 4.2.2 L'approche de Gafni et Bertsekas . . . . . . . . . . . . 161