P. A. Abdulla, B. Jonsson, M. Nilsson, and M. Saksena, A Survey of Regular Model Checking, In: CONCUR, vol.12, issue.3, pp.35-48, 2004.
DOI : 10.1007/BFb0028736

K. R. Apt and D. Kozen, Limits for automatic verification of finite-state concurrent systems, Information Processing Letters, vol.22, issue.6, pp.307-309, 1986.
DOI : 10.1016/0020-0190(86)90071-2

S. Außerlechner, S. Jacobs, and A. Khalimov, Tight Cutoffs for Guarded Protocols with Fairness, International Conference on Verification, Model Checking, and Abstract Interpretation, pp.476-494, 2016.
DOI : 10.1007/978-3-662-49122-5_23

P. Berman, J. A. Garay, and K. J. Perry, Towards optimal distributed consensus, 30th Annual Symposium on Foundations of Computer Science, pp.410-415, 1989.
DOI : 10.1109/SFCS.1989.63511

S. Bernard, S. Devismes, M. G. Potop-butucaru, and S. Tixeuil, Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks, 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-8, 2009.
DOI : 10.1109/IPDPS.2009.5161053

URL : https://hal.archives-ouvertes.fr/hal-01298811

R. Bloem, N. Braud-santoni, and S. Jacobs, Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems, International Conference on Computer Aided Verification, pp.157-176, 2016.
DOI : 10.1007/978-3-642-00768-2_13

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, In: CAV, pp.403-418, 2000.
DOI : 10.1007/10722167_31

URL : https://hal.archives-ouvertes.fr/hal-00159512

D. Moura, L. Bjørner, and N. , Satisfiability modulo theories, Communications of the ACM, vol.54, issue.9, pp.69-77, 2011.
DOI : 10.1145/1995376.1995394

URL : https://hal.archives-ouvertes.fr/hal-01095009

E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM, vol.17, issue.11, pp.643-644, 1974.
DOI : 10.1145/361179.361202

E. Emerson and V. Kahlon, Reducing model checking of the many to the few. Automated Deduction, pp.17-236, 2000.

E. A. Emerson and K. S. Namjoshi, On Reasoning About Rings, International Journal of Foundations of Computer Science, vol.20, issue.04, pp.527-550, 2003.
DOI : 10.1145/4904.4999

A. Fabret and A. Petit, On the undecidability of deadlock detection in families of nets, Lecture Notes in Computer Science, vol.900, pp.479-490, 1995.
DOI : 10.1007/3-540-59042-0_98

A. Farahat and A. Ebnenasir, Local Reasoning for Global Convergence of Parameterized Rings, 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp.496-505, 2012.
DOI : 10.1109/ICDCS.2012.66

B. Finkbeiner and S. Schewe, Bounded synthesis, International Journal on Software Tools for Technology Transfer, vol.3, issue.3:5, pp.5-6
DOI : 10.1109/SFCS.1988.21948

S. M. German and A. P. Sistla, Reasoning about systems with many processes, Journal of the ACM, vol.39, issue.3, pp.675-735, 1992.
DOI : 10.1145/146637.146681

URL : http://www.neng.usu.edu/ece/faculty/bunker/rlist/p675-german.pdf

M. G. Gouda and F. F. Haddix, The Stabilizing Token Ring in Three Bits, Journal of Parallel and Distributed Computing, vol.35, issue.1, pp.43-48, 1996.
DOI : 10.1006/jpdc.1996.0066

D. Jackson, Alloy: a lightweight object modelling notation, ACM Transactions on Software Engineering and Methodology, vol.11, issue.2, pp.256-290, 2002.
DOI : 10.1145/505145.505149

URL : http://sdg.lcs.mit.edu/~dnj/pubs/alloy-journal.pdf

S. Jacobs and R. Bloem, Parameterized synthesis, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.362-376, 2012.
DOI : 10.1007/978-3-642-28756-5_25

URL : http://arxiv.org/pdf/1401.3588

A. Khalimov, S. Jacobs, and R. Bloem, Towards Efficient Parameterized Synthesis, International Workshop on Verification, Model Checking, and Abstract Interpretation, pp.108-127, 2013.
DOI : 10.1007/978-3-642-35873-9_9

A. Klinkhamer and A. Ebnenasir, Verifying Livelock Freedom on Parameterized Rings and Chains, International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.163-177, 2013.
DOI : 10.1007/978-3-319-03089-0_12

A. Klinkhamer and A. Ebnenasir, Shadow/Puppet Synthesis: A Stepwise Method for the Design of Self-Stabilization, IEEE Transactions on Parallel and Distributed Systems, vol.27, issue.11, pp.3338-3350, 2016.
DOI : 10.1109/TPDS.2016.2536023

R. P. Kurshan and K. L. Mcmillan, A Structural Induction Theorem for Processes, Information and Computation, vol.117, issue.1, pp.1-11, 1995.
DOI : 10.1006/inco.1995.1024

URL : https://doi.org/10.1006/inco.1995.1024

C. Lenzen and J. Rybicki, Near-optimal self-stabilising counting and firing squads. arXiv preprint arXiv:1608, p.214, 2016.
DOI : 10.1007/978-3-319-49259-9_21

URL : http://arxiv.org/pdf/1608.00214

A. Pnueli and R. Rosner, Distributed reactive systems are hard to synthesis, Proceedings of 31st IEEE Symposium on Foundation of Computer Science, pp.746-757, 1990.

I. Suzuki, Proving properties of a ring of finite-state machines, Information Processing Letters, vol.28, issue.4, pp.213-214, 1988.
DOI : 10.1016/0020-0190(88)90211-6

G. Varghese, Self-stabilization by local checking and correction, 1993.

G. Varghese, Self-stabilization by counter flushing, The 13th Annual ACM Symposium on Principles of Distributed Computing, pp.244-253, 1994.
DOI : 10.1145/197917.198102