The Multiple Dimensions of Mean-Payoff Games. London, RP 2017. [ ppt] [ pdf]
Robust Synchronization in Markov Decision Processes. Rome, CONCUR 2014. [ pdf]
Partial-Observation Stochastic Games: How to Win when Belief Fails. Dubrovnik, LICS 2012; GT Jeux Cachan 2012. [ ppt] [ pdf]
Games and Automata: From Boolean to Quantitative Verification. HDR defense, Cachan, 2012. [ ppt] [ pdf]
How Much Memory is Needed to Win in Partial-Observation Games. Paris, Games 2011. [ ppt] [ pdf]
Energy and Mean-Payoff Parity Markov Decision Processes. Warsaw, MFCS 2011. [ ppt] [ pdf]
Infinite Synchronizing Words for Probabilistic Automata. Gasics meeting Mons, Belgium, 2011. [ ppt] [ pdf]
Energy Parity Games. Gasics meeting Aalborg, Denmark; Bordeaux, ICALP 2010; Oxford, U.K., Games 2010; Lugano, Switzerland, AVM 2010. [ ppt] [ pdf]
Quantitative Languages: Weighted Automata and Beyond. CFV seminar, Brussels, 2010. [ ppt] [ pdf]
Randomness for Free. Warwick, U.K., WTIS 2010 & Gasics meeting, Paris. [ ppt] [ pdf]
Staying alive in the dark. Chennai (CMI), India, ACTS 2010 & IST Austria. [ ppt] [ pdf]
Expressiveness and Closure Properties for Quantitative Languages. Los Angeles, U.S.A., LICS 2009. [ ppt]
Imperfect-Information Games for System Design. Models, Applications, and Tools. Grenoble, France, PSY 2009. [ pdf]
Quantitative Languages. ENS Cachan & Labri, Uni. Bordeaux, 2009. [ ppt]
Alpaga: a tool for solving parity games with imperfect information. York, U.K., TACAS 2009. [ ppt] [ pdf]
Quantitative Languages. Bertinoro, Italy, CSL 2008. [ ppt] [ pdf]
Games for controller synthesis. Technical talk, MoVeP Summer School, 2008. [ ppt] [ pdf]
Equivalence of labeled Markov chains. RWTH Aachen & ENS Cachan, 2008. [ pdf]
Improved algorithms for the automata based approach to model-checking. Braga, Portugal, TACAS 2007. [ pdf]
Antichains: A New Algorithm for Checking Universality of Finite Automata. Seattle, U.S.A., CAV 2006. [ pdf]
Automatic Rectangular Refinement of Affine Hybrid Systems. Uppsala, Sweden, FORMATS 2005. [ ppt] [ pdf]
Robustness and Implementability of Timed Automata. Grenoble, France, FORMATS-FTRTFT 2004. [ ppt] [ pdf]