• N. Basset, Counting and generating permutations in regular classes of permutations, Algorithmica. version en ligne
• E. Asarin, N. Basset, Aldric DEGORRE, Entropy of Regular Timed Languages, Information and Computation, version en ligne
• N. Basset, A maximal entropy stochastic process for a timed automaton, Information and Computation, version en ligne

• N. Basset, Timed symbolic dynamics, FORMATS'15.
• N. Basset,M. Kwiatkowska, Ufuk Topcu et C. Wiltsche. Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives, TACAS'15.
• N. Basset,M. Kwiatkowska et C. Wiltsche. Compositional Controller Synthesis for Stochastic Games, CONCUR'14.
• N. Basset, Counting and generating permutations using timed languages, LATIN'14.
• E. Asarin, N. Basset, Aldric DEGORRE, Spectral Gap in Timed Automata, FORMATS'13.
• N. Basset, A stochastic process for a timed automaton, ICALP'13.
• E. Asarin, N. Basset, M.-P. Béal, Aldric DEGORRE, Dominique PERRIN, Toward a timed theory of channel coding, FORMATS'12.
• E. ASARIN, N. Basset, Aldric DEGORRE, Dominique PERRIN, Generating functions of timed languages, MFCS'12.
• N. Basset,E. ASARIN, Thin and thick timed regular languages, FORMATS'11, LNCS 6919, © Springer-Verlag, 2011, p.113-128, DOI: 10.1007/978-3-642-24310-3_9

• Le manuscript est ici.
• Les transparents de la soutenance sont ici.
• Les rapport de soutenance et de pré-soutenance sont ici.

• Dynamique symbolique des langages temporisés - M2 internship report (2009) with Eugène ASARIN (LIAFA, Paris)
• Sécurité des descripteur SIFT - M1 internship report (2008) with Ewa KIJAK (INRIA, Rennes).
• Minimization and learning in the class DWBA - L3 internship report (2007) with Martin LEUCKER (T-U-MUNICH)

B. Barbot, N. Basset, M. Beunardeau et M. Kwiatkowska, Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement. Version soumise disponible ici.