A. Abdulla, M. F. Atig, A. Kara, and O. Rezine, Verification of Buffered Dynamic Register Automata, NETYS 2015, 2015.
DOI : 10.1007/978-3-319-26850-7_2

[. Abdulla, M. F. Atig, and O. Rezine, Verification of Directed Acyclic Ad Hoc Networks, FMOODS/FORTE'13, pp.193-208, 2013.
DOI : 10.1007/978-3-642-38592-6_14

[. Abdulla, N. Bertrand, A. Rabinovich, and P. Schnoebelen, Verification of probabilistic systems with faulty communication, Information and Computation, vol.202, issue.2, pp.141-165, 2005.
DOI : 10.1016/j.ic.2005.05.008

[. Abdulla, K. Cerans, B. Jonsson, and Y. Tsay, General decidability theorems for infinite-state systems, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.313-321, 1996.
DOI : 10.1109/LICS.1996.561359

[. Abdulla, K. Cerans, B. Jonsson, and Y. Tsay, Algorithmic Analysis of Programs with Well Quasi-ordered Domains, Information and Computation, vol.160, issue.1-2, pp.109-127, 2000.
DOI : 10.1006/inco.1999.2843

R. Alur and D. Dill, Automata for modeling real-time systems, Automata, languages and programming, pp.322-335, 1990.
DOI : 10.1007/BFb0032042

R. Alur, L. David, and . Dill, A theory of timed automata. Theoretical computer science, pp.183-235, 1994.

L. Aceto, D. De, and F. Escrig, Verification of population protocols, 26th International Conference on Concurrency Theory Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.470-482, 2015.

P. Aziz-abdulla, J. Deneux, and P. Mahata, Multi-clock timed networks, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.345-354, 2004.
DOI : 10.1109/LICS.2004.1319629

A. Abdulla, G. Delzanno, O. Rezine, A. Sangnier, and R. Traverso, On the Verification of Timed Ad Hoc Networks, Formal Modeling and Analysis of Timed Systems, pp.256-270
DOI : 10.1007/978-3-642-04081-8_40

[. Alur, A. Thomas, M. Y. Henzinger, and . Vardi, Parametric realtime reasoning, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp.592-601, 1993.

[. Abdulla and B. Jonsson, Verifying programs with unreliable channels, Logic in Computer Science, 1993. LICS'93 Proceedings of Eighth Annual IEEE Symposium on, pp.160-170, 1993.

[. Abdulla and B. Jonsson, Ensuring completeness of symbolic verification methods for infinite-state systems, Theoretical Computer Science, vol.256, issue.1-2, pp.145-167, 2001.
DOI : 10.1016/S0304-3975(00)00105-5

[. Abdulla and B. Jonsson, Model checking of systems with many identical timed processes, Theoretical Computer Science, vol.290, issue.1, pp.241-264, 2003.
DOI : 10.1016/S0304-3975(01)00330-9

[. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, Parameterized Model Checking of Token-Passing Systems, VMCAI'14, pp.262-281, 2014.
DOI : 10.1007/978-3-642-54013-4_15

R. Krzysztof, . Apt, C. Dexter, and . Kozen, Limits for automatic verification of finite-state concurrent systems, Information Processing Letters, vol.22, issue.6, pp.307-309, 1986.

C. Baier, N. Bertrand, and P. Schnoebelen, A note on the attractor-property of infinite-state Markov chains, Information Processing Letters, vol.97, issue.2, pp.58-63, 2006.
DOI : 10.1016/j.ipl.2005.09.011

N. Baier, P. Bertrand, and . Schnoebelen, Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness, Formal Techniques for Networked and Distributed Systems-FORTE 2006, pp.212-227, 2006.
DOI : 10.1016/S0020-0190(01)00337-4

N. Baier, P. Bertrand, and . Schnoebelen, Verifying nondeterministic probabilistic channel systems against ?-regular lineartime properties, ACM Transactions on Computational Logic, vol.9, issue.1, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00424516

N. Bertrand and P. Fournier, Parameterized verification of many identical probabilistic timed processes, FSTTCS, pp.501-513, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00914263

[. Bertrand, P. Fournier, and A. Sangnier, Playing with Probabilities in Reconfigurable Broadcast Networks, Foundations of Software Science and Computation Structures, pp.134-148, 2014.
DOI : 10.1007/978-3-642-54830-7_9
URL : https://hal.archives-ouvertes.fr/hal-01082129

[. Bertrand, P. Fournier, and A. Sangnier, Distributed local strategies in broadcast networks, 26th International Conference on Concurrency Theory, CONCUR 2015, pp.44-57, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01243595

[. Bollig, P. Gastin, and J. Schubert, Parameterized Verification of Communicating Automata under Context Bounds, RP'14, pp.45-57, 2014.
DOI : 10.1007/978-3-319-11439-2_4
URL : https://hal.archives-ouvertes.fr/hal-00984421

J. Baier and . Katoen, Principles of model checking, 2008.

[. Brázdil, A. Kucera, and O. Strazovský, On the Decidability of Temporal Properties of Probabilistic Pushdown Automata, STACS'05, pp.145-157, 2005.
DOI : 10.1007/978-3-540-31856-9_12

N. Bertrand and P. Schnoebelen, Model Checking Lossy Channels Systems Is Probably Decidable, Foundations of Software Science and Computation Structures, pp.120-135, 2003.
DOI : 10.1007/3-540-36576-1_8
URL : https://hal.archives-ouvertes.fr/inria-00424339

N. Bertrand and P. Schnoebelen, Computable fixpoints in wellstructured symbolic model checking. Formal Methods in System Design, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00906826

D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983.
DOI : 10.1145/322374.322380

[. Chatterjee and L. Doyen, Energy parity games, Theoretical Computer Science, vol.458, pp.49-60, 2012.
DOI : 10.1016/j.tcs.2012.07.038

[. Chatterjee, M. Luca-de-alfaro, A. Faella, and . Legay, Qualitative logics and equivalences for probabilistic systems, Logical Methods in Computer Science, vol.5, issue.2, 2009.

P. Chambart and P. Schnoebelen, The Ordinal Recursive Complexity of Lossy Channel Systems, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.205-216, 2008.
DOI : 10.1109/LICS.2008.47

E. M. Clarke, M. Talupur, T. Touili, and H. Veith, Verification by Network Decomposition, CONCUR'04, pp.276-291, 2004.
DOI : 10.1016/0020-0190(88)90211-6
URL : https://hal.archives-ouvertes.fr/hal-00161110

C. Daws, Symbolic and Parametric Model Checking of Discrete-Time Markov Chains, Theoretical Aspects of Computing-ICTAC 2004, pp.280-294, 2005.
DOI : 10.1007/978-3-540-31862-0_21

C. Dehnert, S. Junges, N. Jansen, F. Corzilius, M. Volk et al., PROPhESY: A PRObabilistic ParamEter SYnthesis Tool, Computer Aided Verification, pp.214-231, 2015.
DOI : 10.1007/978-3-319-21690-4_13

[. Delzanno, A. Sangnier, and R. Traverso, Parameterized Verification of Broadcast Networks of Register Automata, Reachability Problems, pp.109-121, 2013.
DOI : 10.1007/978-3-642-41036-9_11

[. Delzanno, A. Sangnier, R. Traverso, and G. Zavattaro, On the complexity of parameterized reachability in reconfigurable broadcast networks, FSTTCS'12, pp.289-300
URL : https://hal.archives-ouvertes.fr/hal-00740518

[. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Ad Hoc Networks, CONCUR 2010-Concurrency Theory, pp.313-327, 2010.
DOI : 10.1007/978-3-642-15375-4_22

G. Delzanno, A. Sangnier, and G. Zavattaro, On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks, Proc. 14th Int. Conference on Foundations of Software Science and Computational Structures (FoSSaCS'11), pp.441-455, 2011.
DOI : 10.1007/978-3-642-19805-2_30

[. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Safety Properties in Ad Hoc Network Protocols, Proc. 1st Int. Workshop on Process Algebra and Coordination (PACO'11), pp.56-65, 2011.
DOI : 10.4204/EPTCS.60.4

[. Delzanno, A. Sangnier, and G. Zavattaro, Verification of Ad Hoc Networks with Node and Communication Failures, Proc. joint 14th IFIP WG 6.1 Int. Conference and 32nd IFIP WG 6.1 Int. Conference on Formal Techniques for Distributed Systems (FMOODS/FORTE'12), pp.235-250, 2012.
DOI : 10.1007/978-3-642-30793-5_15
URL : https://hal.archives-ouvertes.fr/hal-00909367

J. Esparza, A. Finkel, and R. Mayr, On the verification of broadcast protocols, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.352-359, 1999.
DOI : 10.1109/LICS.1999.782630

J. Esparza, P. Ganty, and R. Majumdar, Parameterized verification of asynchronous shared-memory systems, CAV'13, pp.124-140, 2013.

J. Esparza, Keeping a crowd safe: On the complexity of parameterized verification (invited talk), STACS'14, pp.1-10

[. Etessami and M. Yannakakis, Recursive Markov decision processes and recursive stochastic games, ICALP'05, pp.891-903, 2005.

[. Fruth, Probabilistic model checking of contention resolution in the ieee 802.15. 4 low-rate wireless personal area network protocol, Leveraging Applications of Formal Methods, Verification and Validation Second International Symposium on, pp.290-297, 2006.

A. Finkel and P. Schnoebelen, Well-structured transition systems everywhere! Theor, Comput. Sci, vol.256, issue.12, pp.63-92, 2001.

M. Steven, A. P. German, and . Sistla, Reasoning about systems with many processes, J. ACM, vol.39, issue.3, pp.675-735, 1992.

M. Hague, Parameterised pushdown systems with non-atomic writes. arXiv preprint, 2011.

T. Hune and J. Romijn, Mariëlle Stoelinga, and Frits Vaandrager Linear parametric model checking of timed automata, The Journal of Logic and Algebraic Programming, vol.52, pp.183-220, 2002.

[. Iyer and M. Narasimha, Probabilistic lossy channel systems, TAPSOFT'97: Theory and Practice of Software Development, pp.667-681, 1997.
DOI : 10.1007/BFb0030633

[. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, Computer aided verification, pp.585-591, 2011.
DOI : 10.1007/3-540-45657-0_17
URL : https://hal.archives-ouvertes.fr/hal-00648035

[. Kwiatkowska, G. Norman, D. Parker, and J. Sproston, Modeling and Verification of Real-Time Systems: Formalisms and Software Tools, chapter Verification of Real-Time Probabilistic Systems, pp.249-288, 2008.

[. Kosaraju and G. F. Sullivan, Detecting cycles in dynamic graphs in polynomial time (preliminary version), STOC'88, pp.398-406, 1988.

G. John, L. Kemeny, . Snell, W. Anthony, and . Knapp, Denumerable markov chains. the university series in higher mathematics, 1966.

G. Kim, P. Larsen, W. Pettersson, and . Yi, Uppaal in a nutshell, International Journal on Software Tools for Technology Transfer (STTT), vol.1, issue.1, pp.134-152, 1997.

M. Minsky, Computation: Finite and Infinite Machines, 1967.

A. Pnueli and R. Rosner, Distributed reactive systems are hard to synthesize, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.746-757, 1990.
DOI : 10.1109/FSCS.1990.89597

A. Rabinovich, Quantitative analysis of probabilistic lossy channel systems, Automata, Languages and Programming, pp.1008-1021

O. Michael, D. Rabin, and . Lehmann, The advantages of free choice: A symmetric and fully distributed solution for the dining philosophers problem, A classical mind, pp.333-352, 1994.

S. Schmitz and P. Schnoebelen, The Power of Well-Structured Systems, CONCUR'13, pp.5-24, 2013.
DOI : 10.1007/978-3-642-40184-8_2
URL : https://hal.archives-ouvertes.fr/hal-00907964

Y. Moshe and . Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on, pp.327-338, 1985.