U. Acar, A. Charguéraud, M. Rainey, and F. Sieczkowski, Dagcalculus : A calculus for parallel computation Uniform generation in trace monoids, Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (ICFP)AM15] Samy Abbes and Jean Mairesse Mathematical Foundations of Computer Science 2015 -40th International Symposium, MFCS 2015 Proceedings, Part I, pp.18-32, 2015.

M. Abramowitz, A. Irene, and . Stegun, Handbook of mathematical functions : with formulas, graphs, and mathematical tables, Courier Corporation, vol.55, 1964.

. Bbdl-`-11bbdl-`-bbdl-`-11-]-velleda, N. Baldoni, J. D. Berline, M. Loera, M. Köppe et al., How to integrate a polynomial over a simplex, Mathematics of Computation, vol.80, issue.273, pp.297-325, 2011.

R. Bubley and M. Dyer, Faster random generation of linear extensions. Discrete mathematics, pp.81-88, 1999.

O. Bodini, M. Dien, X. Fontaine, A. Genitrini, and H. Hwang, Increasing Diamonds, Latin American Symposium on Theoretical Informatics, pp.207-219, 2016.
DOI : 10.1007/978-3-662-49529-2_16

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

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 An asymptotic expansion for the coefficients of some formal power series, 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.16-30, 1975.

F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, CAAP, pp.24-48, 1992.
DOI : 10.1007/3-540-55251-0_2

URL : https://hal.archives-ouvertes.fr/inria-00074977

[. Bodini, A. Genitrini, and F. Peschanski, The combinatorics of non-determinism, LIPIcs-Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 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, pp.1-11, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01284220

A. [. Bodini, F. Genitrini, N. Peschanski, and . Rolin, Associativity for Binary Parallel Processes: A Quantitative Study, Algorithms and Discrete Applied Mathematics -First International Conference, CALDAM'15, pp.217-228, 2015.
DOI : 10.1007/978-3-319-14974-5_21

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

M. [. Bouchitte and . Habib, The Calculation of Invariants for Ordered Sets, pp.231-279, 1989.
DOI : 10.1007/978-94-009-2639-4_6

[. Bergeron, G. Labelle, and P. Leroux, Combinatorial species and tree-like structures, 1998.
DOI : 10.1017/CBO9781107325913

[. Bodini, J. Lumbroso, and N. Rolin, Analytic Samplers and the Combinatorial Rejection Method, Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, pp.40-50, 2015.
DOI : 10.1137/1.9781611973761.4

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

]. O. Bod10 and . Bodini, Autour de la génération aléatoire sous modèle de Boltzmann, 2010.

O. Bodini, O. Roussel, and M. Soria, Boltzmann samplers for first-order differential specifications, Discrete Applied Mathematics, vol.160, issue.18, pp.2563-2572, 2012.
DOI : 10.1016/j.dam.2012.05.022

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

G. Brightwell and P. Winkler, Counting linear extensions. Order, pp.225-242, 1991.
DOI : 10.1007/bf00383444

H. Thayer and D. , Introduction to Nonlinear Differential and Integral Equations Courier Corporation, 1962. [dBKR71] Nicolaas Govert de Bruijn, Donald Ervin Knuth, and SO Rice. The average height of planted plane trees, 1971.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Boltzmann Samplers for the Random Generation of Combinatorial Structures, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.577-625, 2004.
DOI : 10.1017/S0963548304006315

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

[. Darrasse, H. Hwang, and M. Soria, Shape Measures of Random Increasing k-trees, Combinatorics, Probability and Computing, vol.6, issue.05, pp.668-699, 2016.
DOI : 10.1007/s00453-006-0109-5

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

[. Loof, H. D. Meyer, and B. D. Baets, Exploiting the lattice of ideals representation of a poset, Fundamenta Informaticae, vol.71, issue.2 3, pp.309-321, 2006.

A. Darrasse, K. Panagiotou, O. Roussel, and M. Soria, Biased boltzmann samplers and generation of extended linear languages with shuffle, 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), pp.125-140, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01197245

D. Duffus and P. Winkler, Minimizing setups for cycle-free ordered sets, Proceedings of the American Mathematical Society, vol.85, issue.4, pp.509-513, 1982.
DOI : 10.1090/S0002-9939-1982-0660592-3

J. Richard and . Duffin, Topology of series-parallel networks, Journal of Mathematical Analysis and Applications, vol.10, issue.2, pp.303-318, 1965.

B. Ellis and W. Wong, Learning Causal Bayesian Network Structures From Experimental Data, Journal of the American Statistical Association, vol.103, issue.482, pp.778-789, 2008.
DOI : 10.1198/016214508000000193

P. Flajolet and A. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019

URL : https://hal.archives-ouvertes.fr/inria-00075725

P. Flajolet and M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails, Discrete Mathematics, vol.114, issue.1-3, pp.159-180, 1993.
DOI : 10.1016/0012-365X(93)90364-Y

URL : https://hal.archives-ouvertes.fr/inria-00075557

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655

URL : https://hal.archives-ouvertes.fr/inria-00072739

M. Gaudel, A. Denise, S. Gouraud, R. Lassaigne, J. Oudinet et al., Coverage-biased Random Exploration of Models, Proceedings of the Fourth Workshop on Model Based Testing, pp.3-14, 2008.
DOI : 10.1016/j.entcs.2008.11.002

URL : https://hal.archives-ouvertes.fr/inria-00560621

A. Genitrini, Combinatoire énumérative et analytique en logique propositionnelle et en théorie de la concurrence :vers une quantification de l'expressivité des modèles, 2017.

D. Grosu, A. Scott, and . Smolka, Labelled formal languages and their uses Monte carlo model checking, TACAS, pp.271-286, 1983.

]. C. Hoa78 and . Hoare, Communicating sequential processes, Commun. ACM, vol.21, issue.8, pp.666-677, 1978.

[. Huber, Fast perfect sampling from linear extensions, Discrete Mathematics, vol.306, issue.4, pp.420-428, 2006.
DOI : 10.1016/j.disc.2006.01.003

URL : https://doi.org/10.1016/j.disc.2006.01.003

H. [. Jarry, F. Casanova, and . Berman, Dagsim : a simulator for dag scheduling algorithms, 2000.

[. Jerrum, L. G. Valiant, and V. V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, vol.43, pp.169-188, 1986.
DOI : 10.1016/0304-3975(86)90174-X

A. Karzanov and L. Khachiyan, On the conductance of order Markov chains, Order, vol.1, issue.1, pp.7-15, 1991.
DOI : 10.1007/BF00385809

A. Knopfmacher, O. Augustine, and . Munagi, Permutations with interval cycles, Ars Comb, vol.105, pp.273-288, 2012.

[. Krob, J. Mairesse, and I. Michos, On the Average Parallelism in Trace Monoids, pp.477-488, 2002.
DOI : 10.1007/3-540-45841-7_39

E. Donald and . Knuth, The Art of Computer Programming) : Seminumerical Algorithms, 1997.

]. D. Knu98 and . Knuth, The art of computer programming) sorting and searching, 1998.

M. Kuba and A. Panholzer, Combinatorial families of multilabelled increasing trees and hook-length formulas, Discrete Mathematics, vol.339, issue.1, pp.227-254, 2016.
DOI : 10.1016/j.disc.2015.08.010

D. F. Lawden, Elliptic Functions and Applications, 2013.
DOI : 10.1007/978-1-4757-3980-0

J. Lumbroso, Optimal discrete uniform generation from coin flips, and applications. CoRR, abs/1304, 1916.

[. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

H. Rolf and . Möhring, Computationally tractable classes of ordered sets, Algorithms and order, pp.105-193, 1989.

T. Ma and J. P. Spinrad, Cycle-free partial orders and chordal comparability graphs, Order, vol.23, issue.1, pp.49-61, 1991.
DOI : 10.1007/BF00385814

[. Miklós and H. Smith, Sampling and counting genome rearrangement scenarios, BMC Bioinformatics, vol.16, issue.Suppl 14, p.6, 2015.
DOI : 10.1186/1471-2105-16-S14-S6

G. Marsaglia and W. W. Tsang, The Ziggurat Method for Generating Random Variables, Journal of Statistical Software, vol.5, issue.8, pp.1-7, 2000.
DOI : 10.18637/jss.v005.i08

J. Oudinet, A. Denise, M. Gaudel, R. Lassaigne, and S. Peyronnet, Uniform Monte-Carlo Model Checking, Fundamental Approaches to Software Engineering -14th International Conference, FASE 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software. Proceedings, pp.127-140, 2011.
DOI : 10.1145/321679.321684

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

]. C. Pet62 and . Petri, Fundamentals of a theory of asynchronous information flow, IFIP Congress, pp.386-390, 1962.

G. Pruesse and F. Ruskey, Generating Linear Extensions Fast, SIAM Journal on Computing, vol.23, issue.2, pp.373-386, 1994.
DOI : 10.1137/S0097539791202647

URL : http://csr.csc.uvic.ca/home/fruskey/Publications/ExtensionFast.ps

C. Pivoteau, B. Salvy, and M. Soria, Algorithms for combinatorial structures: Well-founded systems and Newton iterations, Journal of Combinatorial Theory, Series A, vol.119, issue.8, pp.1711-1773, 2012.
DOI : 10.1016/j.jcta.2012.05.007

URL : https://hal.archives-ouvertes.fr/inria-00622853

M. Soria and A. Darrasse, Degree distribution of random apollonian network structures and boltzmann sampling, Discrete Mathematics & Theoretical Computer Science, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01184769

R. Sedgewick, Left-leaning red-black trees, Dagstuhl Workshop on Data Structures, p.17, 2008.

K. Sen, Effective random testing of concurrent programs, Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering , ASE '07, pp.323-332, 2007.
DOI : 10.1145/1321631.1321679

]. C. Sha48 and . Shannon, A mathematical theory of communication. The Bell System Technical Journal, pp.379-423, 1948.

M. A. Soliman and I. F. Ilyas, Ranking with Uncertain Scores, 2009 IEEE 25th International Conference on Data Engineering, pp.317-328, 2009.
DOI : 10.1109/ICDE.2009.102

URL : http://www.cs.uwaterloo.ca/%7Em2ali/papers/SolimanICDE2009.pdf

P. Richard and . Stanley, Enumeration of posets generated by disjoint unions and ordinal sums, Proceedings of the American Mathematical Society, pp.295-299, 1974.

P. Richard and . Stanley, Two poset polytopes, Discrete & Computational Geometry, vol.1, issue.1, pp.9-23, 1986.

L. Takács, Conditional limit theorems for branching processes, Journal of Applied Mathematics and Stochastic Analysis, vol.4, issue.4, pp.263-292, 1991.
DOI : 10.1155/S1048953391000217

G. Leslie and . Valiant, A bridging model for parallel computation, Commun. ACM, vol.33, issue.8, pp.103-111, 1990.

J. Valdes, R. E. Tarjan, and E. L. Lawler, The recognition of series parallel digraphs, Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC '79, pp.1-12, 1979.

[. Yang, Y. Chen, E. Eide, and J. Regehr, Finding and understanding bugs in C compilers, ACM SIGPLAN Notices, vol.46, issue.6, pp.283-294, 2011.
DOI : 10.1145/1993316.1993532