P. Amestoy, I. S. Duff, J. Excellent, and J. Koster, MUMPS: A General Purpose Distributed Memory Sparse Solver, PARA'2000, pp.121-130, 2000.
DOI : 10.1007/3-540-70734-4_16
URL : https://hal.archives-ouvertes.fr/hal-00856652

H. R. Andersen, Model checking and boolean graphs, Theoretical Computer Science, vol.126, issue.1, pp.3-30, 1994.
DOI : 10.1016/0304-3975(94)90266-6

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

E. Richard, I. Talbi, and . Touche, Grid'5000: A large scale and highly reconfigurable experimental grid testbed, IJHPCA, vol.20, issue.4, pp.481-494, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00684943

J. A. Brzozowski, Derivatives of Regular Expressions, Journal of the ACM, vol.11, issue.4, pp.481-494, 1964.
DOI : 10.1145/321239.321249

D. Champelovier, X. Clerc, H. Garavel, Y. Guerte, C. Mckinty et al., Reference Manual of the LNT to LOTOS Translator (Version 6.2). Inria/Vasy and Inria/Convecs, 2015.

L. O. Chua and P. M. Lin, Computer Aided Analysis of Electronic Circuits, 1975.

E. Clarke, O. Grumberg, and D. Peled, Model Checking, 2000.

R. Cleaveland, S. P. Iyer, and M. Narasimha, Probabilistic temporal logics via the modal mu-calculus, Theoretical Computer Science, vol.342, issue.2-3, pp.316-350, 2005.
DOI : 10.1016/j.tcs.2005.03.048

R. Cleaveland and B. Steffen, A linear-time model-checking algorithm for the alternation-free modal mu-calculus, FMSD, vol.2, issue.2, pp.121-147, 1993.

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-115, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, vol.8, issue.9, p.569, 1965.
DOI : 10.1145/365559.365617

M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol.18, issue.2, pp.194-211, 1979.
DOI : 10.1016/0022-0000(79)90046-1

H. Garavel and F. Lang, SVL: A Scripting Language for Compositional Verification, FORTE'01, pp.377-392, 2001.
DOI : 10.1007/0-306-47003-9_24
URL : https://hal.archives-ouvertes.fr/inria-00072396

H. Garavel, F. Lang, R. Mateescu, and W. Serwe, CADP 2011: a toolbox for the construction and analysis of distributed processes, International Journal on Software Tools for Technology Transfer, vol.1, issue.1/2, pp.89-107, 2013.
DOI : 10.1007/s10009-012-0244-z
URL : https://hal.archives-ouvertes.fr/hal-00715056

H. Hansson and B. Jonsson, A logic for reasoning about time and reliability, Formal Aspects of Computing, vol.2, issue.1, pp.512-535, 1994.
DOI : 10.1007/BF01211866

D. Kozen, Results on the Propositional ??-Calculus, DAIMI Report Series, vol.11, issue.146, pp.333-354, 1983.
DOI : 10.7146/dpb.v11i146.7420

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

K. G. Larsen, Proof systems for hennessy-milner logic with recursion, CAAP'88, pp.215-230, 1988.

K. G. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation, vol.94, issue.1, pp.1-28, 1991.
DOI : 10.1016/0890-5401(91)90030-6

D. Latella, M. Loreti, and M. Massink, On-the-fly fast mean-field model-checking, Trustworthy Global Computing, pp.297-314, 2014.

R. Mateescu, CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems, International Journal on Software Tools for Technology Transfer, vol.8, issue.1, pp.37-56, 2006.
DOI : 10.1007/s10009-005-0194-9
URL : https://hal.archives-ouvertes.fr/inria-00084628

R. Mateescu, P. T. Monteiro, E. Dumas, H. De, and J. , CTRL: Extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks, Theoretical Computer Science, vol.412, issue.26, pp.4122854-2883, 2011.
DOI : 10.1016/j.tcs.2010.05.009
URL : https://hal.archives-ouvertes.fr/inria-00610831

R. Mateescu and W. Serwe, Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols, Science of Computer Programming, vol.78, issue.7, pp.843-861, 2013.
DOI : 10.1016/j.scico.2012.01.003
URL : https://hal.archives-ouvertes.fr/hal-00671321

R. Mateescu and M. Sighireanu, Efficient on-the-fly model-checking for regular alternation-free mu-calculus, Science of Computer Programming, vol.46, issue.3, pp.255-281, 2003.
DOI : 10.1016/S0167-6423(02)00094-1
URL : https://hal.archives-ouvertes.fr/inria-00072755

R. Mateescu and D. Thivolle, A model checking language for concurrent valuepassing systems, FM'08, pp.148-164, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00315312

R. , D. Nicola, and F. W. Vaandrager, Action versus State Based Logics for Transition Systems, Semantics of concurrency, pp.407-419, 1990.