Mathieu Tracol

13 papers A* 2B 1Journal 6Unranked 4
YearRankTypeTitle / Venue / Authors
2016 J jnl
What is decidable about partially observable Markov decision processes with ω-regular objectives.
J. Comput. Syst. Sci.
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
2013 — conf
Approximation of Large Probabilistic Networks by Structured Population Protocols.
CAI
Michel de Rougemont, Mathieu Tracol
2013 B conf
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
CSL
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
2013 J jnl
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.
CoRR
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
2012 A* conf
Decidable Problems for Probabilistic Automata on Infinite Words.
LICS
Krishnendu Chatterjee, Mathieu Tracol
2011 — conf
Computing Distances between Probabilistic Automata
QAPL
Mathieu Tracol, Josée Desharnais, Abir Zhioua
2011 J jnl
Decidable Problems for Probabilistic Automata on Infinite Words
CoRR
Krishnendu Chatterjee, Mathieu Tracol
2011 J jnl
Recurrence and transience for finite probabilistic tables.
Theor. Comput. Sci.
Mathieu Tracol
2011 J jnl
The Decidability Frontier for Probabilistic Automata on Infinite Words
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol
2009 J jnl
Fast convergence to state-action frequency polytopes for MDPs.
Oper. Res. Lett.
Mathieu Tracol
2009 — conf
Recurrence and Transience for Probabilistic Automata.
FSTTCS
Mathieu Tracol, Christel Baier, Marcus Größer
2009 A* conf
Statistic Analysis for Probabilistic Processes.
LICS
Michel de Rougemont, Mathieu Tracol
2008 — conf
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.
QEST
Josée Desharnais, François Laviolette, Mathieu Tracol