Byzantine disk paxos, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04 ,
DOI : 10.1145/1011767.1011801
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
) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998. ,
DOI : 10.1137/S0097539795279463
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
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
Consensus in one communication step, PaCT '01 : Proceedings of the 6th International Conference on Parallel Computing Technologies, pp.42-50, 2001. ,
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
Analysis of Link Reversal Routing Algorithms, SIAM Journal on Computing, vol.35, issue.2, pp.305-326, 2005. ,
DOI : 10.1137/S0097539704443598
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
Unreliable failure detectors for reliable distributed systems, J. ACM, vol.43, issue.2, pp.225-267, 1996. ,
The drinking philosophers problem, ACM Transactions on Programming Languages and Systems, vol.6, issue.4, pp.632-646, 1984. ,
DOI : 10.1145/1780.1804
Tolerating corrupted communication, PODC '07 : Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp.244-253, 2007. ,
Routing without ordering. (under submission, 2008. ,
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
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
The Heard-Of Model : Computing in Distributed Systems with Benign Failures, 2006. ,
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
Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988. ,
DOI : 10.1145/42282.42283
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
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
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
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
Communication predicates for atomic registers sharedmemory . (under submission), 2008. ,
Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.123-149, 1991. ,
DOI : 10.1145/114005.102808
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
On interprocess communication. part ii : Algorithms. Distributed Computing, pp.86-101, 1986. ,
The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998. ,
DOI : 10.1145/279227.279229
The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982. ,
DOI : 10.1145/357172.357176
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
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. ,
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
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=10.1.1.61.5600
A highly adaptive distributed routing algorithm for mobile wireless networks, Proceedings of INFOCOM '97, pp.1405-1413, 1997. ,
DOI : 10.1109/INFCOM.1997.631180
Reaching Agreement in the Presence of Faults, Journal of the ACM, vol.27, issue.2, pp.228-234, 1980. ,
DOI : 10.1145/322186.322188
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=10.1.1.10.6270
Theoretical impediments to artificial intelligence, IFIP Congress, pp.615-619, 1974. ,
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
Time is not a healer, Proceedings of the 6th Symposium on Theor, pp.304-313, 1989. ,
DOI : 10.1007/BFb0028994
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
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
A k-mutual exclusion algorithm for wireless ad hoc networks, Proceedings of the ACM Workshop on Principles of Mobile Computing (POMC), 2001. ,
A mutual exclusion algorithm for ad hoc mobile networks, Wireless Networks, vol.7, issue.6, pp.585-600, 2001. ,
DOI : 10.1023/A:1012363200403
Paxos at war, 2004. ,
14 1.2.1 Machines ,
20 1.3.1 Translations uniformes, p.22 ,
24 2.1.1 Registres SWMR et objets Atomic-Snapshot, p.54 ,
86 2.3.1 Caractérisation des machines HO qui résolvent Consensus ,
160 4.2.1 Notations, 160 4.2.2 L'approche de Gafni et Bertsekas . . . . . . . . . . . . 161 ,