M. Tracol

What is decidable about partially observable Markov decision processes with ω-regular objectives

Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol, 2013, J. Comput. Syst. Sci..

Decidable Problems for Probabilistic Automata on Infinite Words

Krishnendu Chatterjee, Mathieu Tracol, K. Chatterjee, 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

The Decidability Frontier for Probabilistic Automata on Infinite Words pdf

Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol, 2011, ArXiv.

Recurrence and transience for finite probabilistic tables

Mathieu Tracol, M. Tracol, 2011, Theor. Comput. Sci..

Computing Distances between Probabilistic Automata

Mathieu Tracol, Josée Desharnais, Abir Zhioua, 2011, QAPL.

Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games

François Laviolette, Mathieu Tracol, Josée Desharnais, 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

Approximation of Large Probabilistic Networks by Structured Population Protocols

Michel de Rougemont, Mathieu Tracol, M. D. Rougemont, 2013, CAI.

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives

Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol, 2013, CSL.

Fast convergence to state-action frequency polytopes for MDPs

Mathieu Tracol, M. Tracol, 2009, Oper. Res. Lett..