Y. Afek and E. Gafni, A simple characterization of asynchronous computations, Theoretical Computer Science, vol.561, pp.88-95, 2015.
DOI : 10.1016/j.tcs.2014.07.022

Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and T. C. , The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, pp.185-196, 2010.
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00354248

S. Arevalo, A. Fernandez, D. Imbs, E. Jimenez, and M. , Failure detectors in homonymous distributed systems (with an application to consensus) Journal of Parallel and Distributed Systems, pp.83-95, 2015.

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995.

H. Attiya and J. L. 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, Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83), pp.27-30, 1983.

J. Blazewicz, E. Pesch, D. Trystram, and G. Zhang, New perspectives in scheduling theory, Journal of Scheduling, vol.18, issue.4, pp.333-334, 2015.
DOI : 10.1007/s10951-014-0377-x
URL : https://hal.archives-ouvertes.fr/hal-01230289

F. Bonnet and M. Raynal, Anonymous asynchronous systems: the case of failure detectors, Distributed Computing, vol.7, issue.1, pp.141-158, 2013.
DOI : 10.1007/s00446-012-0169-5
URL : https://hal.archives-ouvertes.fr/inria-00452799

Z. Bouzid, M. Raynal, and P. Sutra, Anonymous obstruction-free (n, k)-set agreement with (n?k+1) atomic read/write registers, Proc. 19th Int'l Conference On Principles Of Distributed Systems (OPODIS'15), 17 pages, Leibniz Int'l Proceedings in Informatics (LIPIcs), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01332935

C. Cachin, R. Guerraoui, and L. Rodrigues, Introduction to reliable and secure distributed programming, 2012.
DOI : 10.1007/978-3-642-15260-3

C. Capdevielle, C. Johnen, and A. Milani, Solo-Fast Universal Constructions for Deterministic Abortable Objects, Proc. 28th Int'l Symposium on Distributed Computing (DISC14), Springer LNCS 8784, p.288302, 2014.
DOI : 10.1007/978-3-662-45174-8_20
URL : https://hal.archives-ouvertes.fr/hal-01410291

P. Casteigts, P. Flocchini, E. Godard, N. Santoro, and M. Yamashita, Expressivity of time-varying graphs, Proc. 19th Int'l Symposium on Fundamentals of Computation Theory (FST'13), Springer LNCS 8070, pp.95-106, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00846875

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, Int'l Journal of Parallel, Emergent and Distributed Systems, vol.27, issue.5, p.387408, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00847001

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

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

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

R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, vol.70, issue.1, pp.32-53, 1986.
DOI : 10.1016/S0019-9958(86)80023-7

D. Ph, L. Guernic, P. , and M. , Abstract specification of communication systems, Proc. First IEEE Int'l Conference on Distributed Computing Systems (ICDCS'79), pp.339-346, 1979.

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and A. Tielmann, The disagreement power of an adversary. Distributed Computing, pp.3-4137147, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00376981

E. W. Dijkstra, Some beautiful arguments using mathematical induction, Acta Informatica, vol.13, issue.1, pp.1-8, 1980.
DOI : 10.1007/BF00288531

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

P. Fraigniaud, A. Korman, and P. D. , Towards a complexity theory for local distributed computing, Article 35, 2013.
DOI : 10.1145/2499228

R. Friedman, A. Mostefaoui, S. Rajsbaum, and R. M. , 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

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, p.340, 1979.

R. Guerraoui and N. Lynch, A general characterization of indulgence, ACM Transactions on Autonomous and Adaptive Systems (TAAS), vol.3, issue.4, p.20, 2008.

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

V. Hadzilacos and S. Toueg, A Modular approach to fault-tolerant broadcasts and related problems, 1994.

V. Hadzilacos and S. Toueg, On deterministic abortable objects, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.4-12, 2013.
DOI : 10.1145/2484239.2484241

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, V. Luchangco, and M. Moir, Obstruction-free synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.522-529, 2003.
DOI : 10.1109/ICDCS.2003.1203503

M. P. Herlihy, S. Rajsbaum, and M. , Power and limits of distributed computing shared memory models, Theoretical Computer Science, vol.509, pp.3-24, 2013.
DOI : 10.1016/j.tcs.2013.03.002

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

F. Junqueira and K. Marzullo, A framework for the design of dependent-failure algorithms, Concurrency and Computation: Practice and Experience, vol.16, issue.17, pp.2255-2269, 2007.
DOI : 10.1002/cpe.1170

F. Kuhn, N. A. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.513-522, 2010.
DOI : 10.1145/1806689.1806760

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally!, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.300-309, 2004.
DOI : 10.1145/1011767.1011811

P. Kuznetsov, Understanding non-uniform failure models, Bulletin of EATCS, vol.106, issue.12, pp.54-77, 2012.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

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

N. Linial, Locality in Distributed Graph Algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992.
DOI : 10.1137/0221015

M. Loui and H. Abu-amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, vol.4, pp.163-183, 1987.

N. A. Lynch, Distributed algorithms, p.872, 1996.

Y. Moses and S. Rajsbaum, A Layered Analysis of Consensus, SIAM Journal on Computing, vol.31, issue.4, pp.989-1021, 2002.
DOI : 10.1137/S0097539799364006

A. Mostéfaoui, H. Moumen, and M. Raynal, Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time, Article 31, p.21, 2015.
DOI : 10.1145/2785953

A. Mostéfaoui, S. Rajsbaum, and M. , 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. Mostéfaoui and M. Raynal, Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC '16, 2016.
DOI : 10.1145/2933057.2933095

M. Naor and L. Stockmeyer, What Can be Computed Locally?, SIAM Journal on Computing, vol.24, issue.6, pp.1259-1277, 1995.
DOI : 10.1137/S0097539793254571

D. Padua, Encyclopedia of parallel computing, p.2180, 2011.
DOI : 10.1007/978-0-387-09766-4

D. Peleg, Distributed computing, a locally sensitive approach, SIAM Monographs on Discrete Mathematics and Applications, vol.343, 2000.

M. Raynal, Communication and agreement abstractions for fault-tolerant asynchronous distributed systems, 251 pages, 2010.

M. Raynal, Fault-tolerant agreement in synchronous distributed systems, 2010.

M. Raynal, Concurrent programming: algorithms, principles, and foundations, 2013.
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217

M. Raynal, Distributed algorithms for message-passing systems, pp.978-981, 2013.
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219

M. Raynal, What can be computed in a distributed system? From Programs to Systems, pp.209-224, 2014.

M. Raynal, Parallel computing vs distributed computing: a great confusion, Proc. 1st European EUROPAR Workshop on Parallel and Distributed Computing Education (Euro-EDUPAR), Springer LNCS 9523, pp.41-53, 2015.

M. Raynal, Messages adversaries. Encyclopedia of Algorithms, 2015.

M. Raynal, Concurrent Systems: Hybrid Object Implementations and Abortable Objects, Proc. 21th Int'l European Parallel Computing Conference (EUROPAR'15), Springer LNCS 9233, pp.3-15, 2015.
DOI : 10.1007/978-3-662-48096-0_1

M. Raynal and J. Stainer, Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.166-175, 2013.
DOI : 10.1145/2484239.2484249
URL : https://hal.archives-ouvertes.fr/hal-00920734

M. Raynal, J. Stainer, and G. Taubenfeld, Distributed universality. Algorithmica (2015) DOI 10, pp.453-468, 1007.
URL : https://hal.archives-ouvertes.fr/hal-01097410

N. Santoro and P. Widmayer, Time is not a healer, Proc. 6th Annual Symposium on Theoretical Aspects of Computer Science (STACS'89), Springer LNCS 349, pp.304-316, 1989.
DOI : 10.1007/BFb0028994

N. Santoro and P. Widmayer, Agreement in synchronous networks with ubiquitous faults, Theoretical Computer Science, vol.384, issue.2-3, pp.232-249, 2007.
DOI : 10.1016/j.tcs.2007.04.036

U. Schmid, B. Weiss, and I. Keidar, Impossibility Results and Lower Bounds for Consensus under Link Failures, SIAM Journal on Computing, vol.38, issue.5, pp.1912-1951, 2009.
DOI : 10.1137/S009753970443999X

J. Suomela, Survey of local algorithms, ACM Computing Surveys, vol.45, issue.2, 2013.
DOI : 10.1145/2431211.2431223

G. Taubenfeld, Synchronization algorithms and concurrent programming, 423 pages, Pearson Education, 2006.

A. M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. of the, pp.230-265, 1936.