Mathieu Tracol

According to our database1, Mathieu Tracol authored at least 11 papers between 2008 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
What is decidable about partially observable Markov decision processes with ω-regular objectives.
J. Comput. Syst. Sci., 2016

2013
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Approximation of Large Probabilistic Networks by Structured Population Protocols.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012
Decidable Problems for Probabilistic Automata on Infinite Words.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011
Recurrence and transience for finite probabilistic tables.
Theor. Comput. Sci., 2011

Computing Distances between Probabilistic Automata
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

The Decidability Frontier for Probabilistic Automata on Infinite Words
CoRR, 2011

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

Statistic Analysis for Probabilistic Processes.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Recurrence and Transience for Probabilistic Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008


  Loading...