D. Aldous, An introduction to covering problems for random walks on graphs, Journal of Theoretical Probability, vol.15, issue.1, pp.197-211, 1991.
DOI : 10.1007/BF01048271

R. Alur, L. De-alfaro, R. Grosu, T. A. Henzinger, M. Kang et al., jMocha: a model checking tool that exploits design structure, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001, pp.835-836, 2001.
DOI : 10.1109/ICSE.2001.919196

R. Alur and T. A. Henzinger, Reactive modules. Formal Methods in System Design, pp.7-48, 1999.
DOI : 10.1109/lics.1996.561320

R. Alur, T. A. Henzinger, F. Y. Mang, S. Qadeer, S. K. Rajamani et al., MOCHA: Modularity in model checking, Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV), pp.521-525, 1998.
DOI : 10.1007/BFb0028774

A. Arnold, Finite Transition Systems, 1994.

J. Berstel and C. Reutenauer, Rational series and their languages, 1987.
DOI : 10.1007/978-3-642-73235-5
URL : https://hal.archives-ouvertes.fr/hal-00619791

E. Brinksma and J. Tretmans, Testing Transition Systems: An Annotated Bibliography, LNCS, vol.2067, pp.187-195, 2001.
DOI : 10.1007/3-540-45510-8_9
URL : http://eprints.eemcs.utwente.nl/secure2/00006456/01/fulltext.pdf

A. Cavalli, D. Lee, C. Rinderknecht, and F. Zaidi, Hit-or-Jump: An Algorithm for Embedded Testing with Applications to in Services, Proc. FORTE/PSTV, 1999.
DOI : 10.1007/978-0-387-35578-8_3

A. Demaille, T. Herault, and S. Peyronnet, Probabilistic verification of sensor networks, 2006 International Conference onResearch, Innovation and Vision for the Future, 2006.
DOI : 10.1109/RIVF.2006.1696417

A. Denise, M. Gaudel, and S. Gouraud, A Generic Method for Statistical Testing, 15th International Symposium on Software Reliability Engineering, pp.25-34, 2004.
DOI : 10.1109/ISSRE.2004.2

M. Duflot, L. Fribourg, T. Herault, R. Lassaigne, F. Magniette et al., Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC, Proc. 4th Int. Workshop on Automated Verification of Critical Systems Electronic Notes in Theor. Comp. Sci, 2004.
DOI : 10.1016/j.entcs.2005.04.012

. Ph, R. Flajolet, and . Sedgewick, Analytic combinatorics: functional equations, rational, and algebraic functions, INRIA Research Report pages. Part of the book project " Analytic Combinatorics, p.98, 2001.

. Ph, P. Flajolet, B. Zimmermann, and . Van-cutsem, A Calculus for the Random Generation of Labelled Combinatorial Structures, Theoretical Computer Science, vol.132, pp.1-35, 1994.

S. Gouraud, A. Denise, M. Gaudel, and B. Marre, A new way of automating statistical testing methods, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), pp.5-12, 2001.
DOI : 10.1109/ASE.2001.989785

R. Grosu and S. A. Smolka, Monte Carlo Model Checking, Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2005), pp.271-286, 2005.
DOI : 10.1007/978-3-540-31980-1_18

G. Guirado, T. Hérault, R. Lassaigne, and S. Peyronnet, Distribution, approximation and probabilistic model checking. 4th Parallel and Distributed Methods in Verification (PDMC 05) Electronic Notes in Theor, Comp. Sci, 2005.
DOI : 10.1016/j.entcs.2005.10.016
URL : http://doi.org/10.1016/j.entcs.2005.10.016

T. Hérault, R. Lassaigne, F. Magniette, and S. Peyronnet, Approximate Probabilistic Model Checking, Proceedings of Fifth International VMCAI'04, pp.73-84, 2004.
DOI : 10.1007/978-3-540-24622-0_8

T. Hickey and J. Cohen, Uniform Random Generation of Strings in a Context-Free Language, SIAM Journal on Computing, vol.12, issue.4, pp.645-655, 1983.
DOI : 10.1137/0212044

W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30, 1963.
DOI : 10.1214/aoms/1177730491

P. R. James, M. Endler, and M. Gaudel, Development of an Atomic Broadcast Protocol using LOTOS, Software Practice and Experience, pp.699-719, 1999.

M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration. Approximation Algorithms for NP-hard, 1996.

R. M. Karp, M. Luby, and N. Madras, Monte-Carlo algorithms for enumeration and reliability problems, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.429-448, 1989.
DOI : 10.1109/SFCS.1983.35

M. Kwiatkowska, G. Norman, and D. Parker, Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach, Proc. TACAS'02, pp.52-66, 2002.

R. Lassaigne and S. Peyronnet, Probabilistic Verification and Approximation, Proc. of the 12th Workshop on Logic, Language, Information and Computation (Wollic 05, pp.101-114, 2006.
DOI : 10.1016/j.entcs.2005.05.031
URL : http://doi.org/10.1016/j.apal.2007.11.006

D. Lee, K. K. Sabnani, D. M. Kristol, and S. Paul, Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach, IEEE Transactions on Communications, vol.44, issue.5, pp.44-49, 1996.
DOI : 10.1109/26.494307

D. Lee and M. Yannakakis, Principles and methods of testing finite state machines-a survey, The Proceedings of IEEE, pp.1089-1123, 1996.
DOI : 10.1109/5.533956

M. Mihail and C. H. Papadimitriou, On the random walk method for protocol testing, Proc. Computer-Aided Verification, pp.132-141, 1994.
DOI : 10.1007/3-540-58179-0_49

P. Website, R. Pelánek, T. Hanïlhanïl, I. Aerná, and L. Brim, Enhancing random walk state space exploration, 10th international workshop on Formal methods for industrial critical systems, 2005.

H. Sivaraj and G. Gopalakrishnan, Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking, Proc. of Parallel and Distributed Model Checking (PDMC'03), 2003.
DOI : 10.1016/S1571-0661(05)80096-9

N. M. Thiéry, Mupad-combinat algebraic combinatorics package for MUPAD

C. H. West, Protocol validation in complex systems, ACM SIGCOMM Computer Communication Review, vol.19, issue.4, pp.303-312, 1989.
DOI : 10.1145/75247.75276