R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

E. Asarin, N. Basset, and A. Degorre, Spectral Gap in Timed Automata, Lecture Notes in Computer Science, vol.8053, pp.16-30, 2013.
DOI : 10.1007/978-3-642-40229-6_2

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

E. Asarin, N. Basset, A. Degorre, and D. Perrin, Generating Functions of Timed Languages, MFCS, pp.124-135, 2012.
DOI : 10.1007/978-3-642-32589-2_14

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

E. Asarin and A. Degorre, Volume and Entropy of Regular Timed Languages: Analytic Approach, Lecture Notes in Computer Science, vol.126, pp.13-27, 2009.
DOI : 10.1016/0304-3975(94)90010-8

N. Basset, A Maximal Entropy Stochastic Process for a Timed Automaton,, Lecture Notes in Computer Science, vol.7966, issue.2, pp.61-73, 2013.
DOI : 10.1007/978-3-642-39212-2_9

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

O. Bernardi and O. Giménez, A Linear Algorithm for the Random Sampling from??Regular Languages, Algorithmica, vol.8, issue.1, pp.130-145, 2012.
DOI : 10.1007/s00453-010-9446-5

P. Bouyer and A. Petit, A Kleene/Büchi-like theorem for clock languages, Journal of Automata, Languages and Combinatorics, vol.7, issue.2, pp.167-186, 2002.

R. Ehrenborg and J. Jung, Descent pattern avoidance, Advances in Applied Mathematics, vol.49, issue.3-5, 2012.
DOI : 10.1016/j.aam.2012.08.004

URL : http://arxiv.org/abs/1312.2027

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

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

P. Flajolet, P. Zimmerman, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7

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

T. Hibi and N. Li, Unimodular equivalence of order and chain polytopes. arXiv preprint, 2012.

S. Kitaev, Patterns in permutations and words, 2011.

A. Nijenhuis and H. S. Wilf, Combinatorial algorithms for computers and calculators, Computer Science and Applied Mathematics, 1978.

R. P. Stanley, Two poset polytopes, Discrete & Computational Geometry, vol.31, issue.1, pp.9-23, 1986.
DOI : 10.1007/BF02187680

R. P. Stanley, A survey of alternating permutations, Combinatorics and graphs, pp.165-196, 2010.
DOI : 10.1090/conm/531/10466