Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt et al., Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.
DOI : 10.1145/153724.153741

E. Anceaume, A. Fernandez, A. Mostefaoui, G. Neiger, and M. Raynal, A necessary and sufficient condition for transforming limited accuracy failure detectors, Journal of Computer and System Sciences, vol.68, issue.1, pp.123-133, 2004.
DOI : 10.1016/j.jcss.2003.08.003

H. Attiya and Z. Avidor, Wait-Free n-Set Consensus when Inputs are Restricted, Proc. 16th Int. Symposium on Distributed Computing (DISC'02), pp.326-338, 2002.

H. Attiya and O. Rachman, ) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998.
DOI : 10.1137/S0097539795279463

H. Attiya and J. Welch, Distributed Computing, Fundamentals, Simulation and Advanced Topics, Wiley Series on Parallel and Distributed Computing, p.414, 2004.

E. Borowsky and E. Gafni, -resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993.
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459

T. D. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.
DOI : 10.1145/234533.234549

T. D. 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

S. Chaudhuri, More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993.
DOI : 10.1006/inco.1993.1043

S. Chaudhuri, M. Herlihy, N. Lynch, and M. Tuttle, Tight bounds for k-set agreement, Journal of the ACM, vol.47, issue.5, pp.912-943, 2000.
DOI : 10.1145/355483.355489
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.5266

F. Chu, Reducing ? to 3W, Information Processing Letters, vol.76, issue.6, pp.293-298, 1998.

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetsov et al., The weakest failure detectors to solve certain fundamental problems in distributed computing, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.338-346, 2004.
DOI : 10.1145/1011767.1011818

D. Prisco, R. Malkhi, D. Reiter, and M. , On k-set consensus problems in asynchronous systems, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.1, pp.7-21, 2001.
DOI : 10.1109/71.899936

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 and N. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, vol.14, issue.4, pp.183-186, 1982.
DOI : 10.1016/0020-0190(82)90033-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

R. Friedman, A. Mostefaoui, S. Rajsbaum, and M. Raynal, Asynchronous Agreement and Its Relation with Error-Correcting Codes, IEEE Transactions on Computers, vol.56, issue.7, pp.865-875, 2007.
DOI : 10.1109/TC.2007.1043
URL : https://hal.archives-ouvertes.fr/inria-00338071

R. Friedman, A. Mostefaoui, and M. , The Notion of Veto Number for Distributed Agreement Problems. Keynote speech, Proc. 6th Int. Workshop on Distributed Computing, pp.315-325, 2004.

E. Gafni, Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC'00), pp.143-152, 1998.
DOI : 10.1145/277697.277724

E. Gafni, R. Guerraoui, and B. Pochon, From a static impossibility to an adaptive lower bound, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , STOC '05, 2005.
DOI : 10.1145/1060590.1060696

R. Guerraoui, Indulgent Algorithms, Proc. 19th Int. ACM Symposium on Principles of Distributed Computing (PODC'00), pp.289-297, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00992775

R. Guerraoui, Non-blocking atomic commit in asynchronous distributed systems with failure detectors, Distributed Computing, pp.17-25, 2002.
DOI : 10.1007/s446-002-8027-4

R. Guerraoui and M. Raynal, The information structure of indulgent consensus, IEEE Transactions on Computers, vol.53, issue.4, pp.453-466, 2004.
DOI : 10.1109/TC.2004.1268403

R. Guerraoui and M. Raynal, The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, pp.53-67, 2007.
DOI : 10.1093/comjnl/bxl046

R. Guerraoui and A. Schiper, Gamma-accurate Failure Detectors, Proc. 10th Workshop on Distributed Algorithms (WDAG'96), pp.269-286, 1996.

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

M. P. Herlihy and L. D. Penso, Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors, Distributed Computing, pp.157-166, 2005.

M. P. Herlihy and S. Rajsbaum, Algebraic spans, Mathematical Structures in Computer Science, vol.10, issue.4, pp.549-573, 2000.
DOI : 10.1017/S0960129500003170

M. P. Herlihy and N. Shavit, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529

M. P. Herlihy and J. L. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.
DOI : 10.1145/78969.78972

M. Hurfin, A. Mostefaoui, and M. Raynal, A versatile family of consensus protocols based on Chandra-Toueg's unreliable failure detectors, IEEE Transactions on Computers, vol.51, issue.4, pp.395-408, 2002.
DOI : 10.1109/12.995450

T. Izumi and T. Masuzawa, Condition adaptation in synchronous consensus, IEEE Transactions on Computers, vol.55, issue.7, pp.843-853, 2006.
DOI : 10.1109/TC.2006.99

L. Lamport and M. Fischer, Byzantine Generals and Transaction Commit Protocols. Unpublished manuscript, 16 pages, 1982.

W. Lo and V. Hadzilacos, Using failure detectors to solve consensus in asynchronous shared-memory systems, Proc. 8th Int'l Workshop on Distributed Computing (WDAG'94), pp.280-295, 1994.
DOI : 10.1007/BFb0020440

A. Mostefaoui, E. Mourgaya, and M. , Asynchronous implementation of failure detectors, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings., pp.351-360, 2003.
DOI : 10.1109/DSN.2003.1209946

A. Mostefaoui, S. Rajsbaum, and M. Raynal, Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003.
DOI : 10.1145/950620.950624

A. Mostefaoui, S. Rajsbaum, and M. Raynal, Synchronous condition-based consensus, Distributed Computing, vol.11, issue.1, pp.325-343, 2006.
DOI : 10.1007/s00446-005-0148-1

A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers, On the Computability Power and the Robustness of Set Agreementoriented Failure Detector Classes. Distributed Computing. To appear: DOI 10, pp.446-454, 1007.
URL : https://hal.archives-ouvertes.fr/hal-00432977

A. Mostefaoui, S. Rajsbaum, M. Raynal, and M. Roy, Condition-Based Protocols for Set Agreement Problems, Proc. 16th Int. Symposium on Distributed Computing (DISC'02), pp.46-62, 2002.
DOI : 10.1007/3-540-36108-1_4

A. Mostefaoui, S. Rajsbaum, M. Raynal, and M. Roy, Condition-based consensus solvability: a hierarchy of conditions and efficient protocols, Distributed Computing, vol.17, issue.1, pp.1-20, 2004.
DOI : 10.1007/s00446-003-0093-9

A. Mostefaoui, S. Rajsbaum, M. Raynal, and C. Travers, From to : A simple bounded quiescent reliable broadcast-based transformation, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.125-129, 2007.
DOI : 10.1016/j.jpdc.2006.06.002
URL : https://hal.archives-ouvertes.fr/inria-00338081

A. Mostéfaoui and M. Raynal, Solving Consensus Using Chandra-Toueg???s Unreliable Failure Detectors: A General Quorum-Based Approach, Proc. 13th Int. Symposium on Distributed Computing (DISC'99), pp.49-63, 1999.
DOI : 10.1007/3-540-48169-9_4

A. Mostefaoui and M. Raynal, k-set agreement with limited accuracy failure detectors, Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, pp.143-152, 2000.
DOI : 10.1145/343477.343536

A. Mostefaoui and M. Raynal, Randomized k-set agreement, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.291-297, 2001.
DOI : 10.1145/378580.378690

A. Mostefaoui and M. Raynal, LEADER-BASED CONSENSUS, Parallel Processing Letters, vol.11, issue.01, pp.95-107, 2001.
DOI : 10.1142/S0129626401000452

G. Neiger, Failure Detectors and the Wait-Free Hierarchy, Proc. 14th Int. ACM Symposium on Principles of Distributed Computing (PODC'95, pp.100-109, 1995.

R. Parvédy-ph, M. Raynal, and C. Travers, Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures, Proc. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06), pp.182-196, 2006.
DOI : 10.1007/11780823_15

M. Raynal, Consensus in synchronous systems: a concise guided tour, 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings., pp.221-228, 2002.
DOI : 10.1109/PRDC.2002.1185641

M. Saks and F. Zaharoglou, -set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000.
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526

A. Schiper, Early Consensus in an Asynchronous System with a Weak Failure Detector, Distributed Computing, pp.149-157, 1997.

J. Yang, G. Neiger, and E. Gafni, Structured derivations of consensus algorithms for failure detectors, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.297-308, 1998.
DOI : 10.1145/277697.277755

Y. Zibin, Condition-Based Consensus in Synchronous Systems, Proc. 17th Int. Symposium on Distributed Computing, pp.239-248, 2003.
DOI : 10.1007/978-3-540-39989-6_17