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

M. Biely, P. Robinson, and U. Schmid, Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement, Proc. 11th Int'l Conference on Principles of Distributed Systems (OPODIS'09), pp.285-299, 2009.
DOI : 10.1007/978-3-642-10877-8_23

F. Bonnet and M. Raynal, On the Road to the Weakest Failure Detector for k-Set Agreement in Message-passing Systems, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00649311

F. Bonnet and M. Raynal, A simple proof of the necessity of the failure detector ?? to implement an atomic register in asynchronous message-passing systems, Information Processing Letters, vol.110, issue.4, pp.153-157, 2010.
DOI : 10.1016/j.ipl.2009.11.011
URL : https://hal.archives-ouvertes.fr/inria-00543125

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

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

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

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, A realistic look at failure detectors, Proceedings International Conference on Dependable Systems and Networks, pp.345-353, 2002.
DOI : 10.1109/DSN.2002.1028919

C. Delporte-gallet, H. Fauconnier, and R. Guerraoui, Tight Failure Detection Bounds on Atomic Object Implementations, Journal of the ACM, vol.57, issue.22, 2010.

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and A. Tielmann, The Weakest Failure Detector for Message Passing Set-Agreement, Proc. 22th Int'l Symposium on Distributed Computing Springer-Verlag LNCS #5218, pp.109-120, 2008.
DOI : 10.1007/978-3-540-87779-0_8
URL : https://hal.archives-ouvertes.fr/hal-00260000

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

N. A. Lynch, Distributed Algorithms, 1996.

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

M. Raynal and S. Agreement, Encyclopedia of Algorithms, pp.829-831, 2008.

M. Raynal, A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, vol.36, issue.1, pp.1181-1191, 2009.
DOI : 10.1145/1052796.1052806

M. Raynal, Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010.
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036

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

M. Raynal, Failure Detectors to solve Asynchronous k-set Agreement: a Glimpse of Recent Results, The Bulletin of EATCS, vol.103, pp.75-95, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00536089

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