S. Abbes and J. Mairesse, Uniform generation in trace monoids, 40th International Symposium MFCS, pp.63-75, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01328454

S. Arora and B. Barak, Computational Complexity -A Modern Approach, 2009.

N. Basset, J. Mairesse, and M. Soria, Uniform sampling for networks of automata, 28th International Conference CONCUR, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01545936

M. Bendkowski, O. Bodini, and S. Dovgal, Polynomial tuning of multiparametric combinatorial samplers, pp.92-106, 2018.

O. Bodini, M. Dien, A. Genitrini, and F. Peschanski, Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets, 12th International Symposium CSR, pp.71-84, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01476189

O. Bodini, M. Dien, A. Genitrini, and F. Peschanski, The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes, 14th SIAM Meeting ANALCO, pp.16-30, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01448695

O. Bodini, A. Genitrini, and F. Peschanski, The Combinatorics of Non-determinism, IARCS Annual Conference FSTTCS, vol.24, pp.425-436, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01216553

O. Bodini, A. Genitrini, and F. Peschanski, A Quantitative Study of Pure Parallel Processes, Electronic Journal of Combinatorics, vol.23, issue.1, p.39, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01284220

O. Bodini, M. Dien, A. Genitrini, and F. Peschanski, The Combinatorics of Barrier Synchronization, International Conference Petri Nets, pp.386-405, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02163607

A. Darrasse, K. Panagiotou, O. Roussel, and M. Soria, Boltzmann generation for regular languages with shuffle, GASCOM 2010 -Conference on random generation of combinatorial structures, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00548898

P. Flajolet, D. Gardy, and L. Thimonier, Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search, D. A. Math, vol.39, issue.3, pp.207-229, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00075832

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, P. Zimmermann, and B. V. Cutsem, A calculus for the random generation of combinatorial structures, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00917729

M. Gaudel, A. Denise, S. Gouraud, R. Lassaigne, J. Oudinet et al., Coverage-biased random exploration of models, Electr. Notes Theor. Comput. Sci, vol.220, issue.1, pp.3-14, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00560621

R. Grosu and S. A. Smolka, Monte carlo model checking, 11th International Conference TACAS, pp.271-286, 2005.

W. Hart, F. Johansson, and S. Pancratz, , 2013.

C. J. Koomen, Calculus of Communicating Systems, pp.11-26, 1991.

D. Krob, J. Mairesse, and I. Michos, On the average parallelism in trace monoids, 19th Annual STACS, pp.477-488, 2002.

C. Martínez and X. Molinero, An experimental study of unranking algorithms, pp.326-340, 2004.

X. Molinero, Ordered generation of classes of combinatorial structures, 2005.