Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. - Josée Desharnais; François Laviolette; Mathieu Tracol (QEST, 2008)

Recurrence and Transience for Probabilistic Automata. - Mathieu Tracol; Christel Baier; Marcus Größer (FSTTCS, 2009)

Statistic Analysis for Probabilistic Processes. - Michel de Rougemont; Mathieu Tracol (LICS, 2009)

Fast convergence to state-action frequency polytopes for MDPs. - Mathieu Tracol (Oper. Res. Lett., 2009)

The Decidability Frontier for Probabilistic Automata on Infinite Words - Krishnendu Chatterjee; Thomas A. Henzinger; Mathieu Tracol (CoRR, 2011)

Computing Distances between Probabilistic Automata - Mathieu Tracol; Josée Desharnais; Abir Zhioua (QAPL, 2011)

Recurrence and transience for finite probabilistic tables. - Mathieu Tracol (Theor. Comput. Sci., 2011)

Decidable Problems for Probabilistic Automata on Infinite Words. - Krishnendu Chatterjee; Mathieu Tracol (LICS, 2012)

Approximation of Large Probabilistic Networks by Structured Population Protocols. - Michel de Rougemont; Mathieu Tracol (CAI, 2013)

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. - Krishnendu Chatterjee; Martin Chmelik; Mathieu Tracol (CSL, 2013)

What is decidable about partially observable Markov decision processes with ω-regular objectives. - Krishnendu Chatterjee; Martin Chmelik; Mathieu Tracol (J. Comput. Syst. Sci., 2016)