P. A. Abdulla, K. Cerans, B. Jonsson, and Y. Tsay, General decidability theorems for infinite-state systems, LICS. pp, pp.313-321, 1996.

B. Aminof, S. Rubin, I. Stoilkovska, J. Widder, and F. Zuleger, Parameterized model checking of synchronous distributed algorithms by abstraction, VMCAI. LNCS, vol.10747, pp.1-24, 2018.

H. Attiya and J. Welch, , 2004.

S. Bardin, J. Leroux, and G. Point, Fast extended release, CAV. pp, pp.63-66, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00344195

C. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovic et al., CVC4. In: CAV. pp, pp.171-177, 2011.

P. Berman, J. A. Garay, and K. J. Perry, Asymptotically optimal distributed consensus, 1989.

P. Berman, J. A. Garay, and K. J. Perry, Towards optimal distributed consensus (extended abstract), FOCS. pp, pp.410-415, 1989.

M. Biely, U. Schmid, and B. Weiss, Synchronous consensus under hybrid process and link failures, Theor. Comput. Sci, vol.412, issue.40, pp.5602-5630, 2011.

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic model checking without BDDs, TACAS. LNCS, vol.1579, pp.193-207, 1999.

S. Chaudhuri, M. Herlihy, N. A. Lynch, and M. R. Tuttle, Tight bounds for k-set agreement, J. ACM, vol.47, issue.5, pp.912-943, 2000.

E. M. Clarke, D. Kroening, J. Ouaknine, and O. Strichman, Completeness and complexity of bounded model checking, VMCAI. LNCS, vol.2937, pp.85-96, 2004.

C. Dr?-agoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, A logic-based framework for verifying consensus algorithms, VMCAI. LNCS, vol.8318, pp.161-181, 2014.

E. A. Emerson and K. S. Namjoshi, Automatic verification of parameterized synchronous systems, CAV, LNCS, vol.1102, pp.87-98, 1996.

E. A. Emerson and K. S. Namjoshi, On reasoning about rings, Int. J. Found. Comput. Sci, vol.14, issue.4, pp.527-550, 2003.

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.

I. Konnov, M. Lazi´clazi´c, H. Veith, and J. Widder, A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms, POPL. pp, pp.719-734, 2017.

I. Konnov, H. Veith, and J. Widder, SMT and POR beat counter abstraction: Parameterized model checking of threshold-based distributed algorithms, CAV (Part I), vol.9206, pp.85-102, 2015.

I. V. Konnov, H. Veith, and J. Widder, On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability. Information and Computation, vol.252, pp.95-109, 2017.

D. Kroening and O. Strichman, Efficient computation of recurrence diameters, VMCAI. LNCS, vol.2575, pp.298-309, 2003.

J. Kukovec, I. Konnov, and J. Widder, Reachability in parameterized systems: All flavors of threshold automata, CONCUR. pp, vol.19, p.17, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01871142

M. Lazi´clazi´c, I. Konnov, J. Widder, and R. Bloem, Synthesis of distributed algorithms with parameterized threshold guards, OPODIS. LIPIcs, vol.95, p.20, 2017.

N. Lynch, Distributed Algorithms, 1996.