Robustness and Implementability of Timed Automata. - Martin De Wulf; Laurent Doyen 001; Nicolas Markey; Jean-François Raskin (FORMATS/FTRTFT, 2004)

Systematic Implementation of Real-Time Models. - Martin De Wulf; Laurent Doyen 001; Jean-François Raskin (FM, 2005)

Automatic Rectangular Refinement of Affine Hybrid Systems. - Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (FORMATS, 2005)

Almost ASAP semantics: from timed models to timed implementations. - Martin De Wulf; Laurent Doyen 001; Jean-François Raskin (Formal Aspects Comput., 2005)

Antichains: A New Algorithm for Checking Universality of Finite Automata. - Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (CAV, 2006)

Algorithms for Omega-Regular Games with Imperfect Information, . - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (CSL, 2006)

A Lattice Theory for Solving Games of Imperfect Information. - Martin De Wulf; Laurent Doyen 001; Jean-François Raskin (HSCC, 2006)

Improved Algorithms for the Automata-Based Approach to Model-Checking. - Laurent Doyen 001; Jean-François Raskin (TACAS, 2007)

Robust parametric reachability for timed automata. - Laurent Doyen 001 (Inf. Process. Lett., 2007)

Algorithms for Omega-Regular Games with Imperfect Information. - Jean-François Raskin; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Log. Methods Comput. Sci., 2007)

Alaska. - Martin De Wulf; Laurent Doyen 001; Nicolas Maquet; Jean-François Raskin (ATVA, 2008)

Strategy Construction for Parity Games with Imperfect Information. - Dietmar Berwanger; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Sangram Raje (CONCUR, 2008)

Interface theories with component reuse. - Laurent Doyen 001; Thomas A. Henzinger; Barbara Jobstmann; Tatjana Petrov (EMSOFT, 2008)

On the Power of Imperfect Information. - Dietmar Berwanger; Laurent Doyen 001 (FSTTCS, 2008)

Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. - Martin De Wulf; Laurent Doyen 001; Nicolas Maquet; Jean-François Raskin (TACAS, 2008)

Robust safety of timed automata. - Martin De Wulf; Laurent Doyen 001; Nicolas Markey; Jean-François Raskin (Formal Methods Syst. Des., 2008)

Equivalence of Labeled Markov Chains. - Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (Int. J. Found. Comput. Sci., 2008)

Probabilistic Weighted Automata. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (CONCUR, 2009)

Alternating Weighted Automata. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (FCT, 2009)

Realizability of Real-Time Logics. - Laurent Doyen 001; Gilles Geeraerts; Jean-François Raskin; Julien Reichert (FORMATS, 2009)

A Survey of Stochastic Games with Limsup and Liminf Objectives. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (ICALP (2), 2009)

Alpaga: A Tool for Solving Parity Games with Imperfect Information. - Dietmar Berwanger; Krishnendu Chatterjee; Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger (TACAS, 2009)

Antichains for the Automata-Based Approach to Model-Checking - Laurent Doyen 001; Jean-François Raskin (Log. Methods Comput. Sci., 2009)

Robustness of Sequential Circuits. - Laurent Doyen 001; Thomas A. Henzinger; Axel Legay; Dejan Nickovic (ACSD, 2010)

Mean-Payoff Automaton Expressions. - Krishnendu Chatterjee; Laurent Doyen 001; Herbert Edelsbrunner; Thomas A. Henzinger; Philippe Rannou (CONCUR, 2010)

Energy and Mean-Payoff Games with Imperfect Information. - Aldric Degorre; Laurent Doyen 001; Raffaella Gentilini; Jean-François Raskin; Szymon Torunczyk (CSL, 2010)

Generalized Mean-payoff and Energy Games. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (FSTTCS, 2010)

The Complexity of Partial-Observation Parity Games. - Krishnendu Chatterjee; Laurent Doyen 001 (LPAR (Yogyakarta), 2010)

Qualitative Analysis of Partially-Observable Markov Decision Processes. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (MFCS, 2010)

Antichain Algorithms for Finite Automata. - Laurent Doyen 001; Jean-François Raskin (TACAS, 2010)

Expressiveness and Closure Properties for Quantitative Languages - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Log. Methods Comput. Sci., 2010)

Strategy construction for parity games with imperfect information. - Dietmar Berwanger; Krishnendu Chatterjee; Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger (Inf. Comput., 2010)

Quantitative languages. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (ACM Trans. Comput. Log., 2010)

Games with imperfect information: theory and algorithms. - Laurent Doyen 001; Jean-François Raskin (Lectures in Game Theory for Computer Scientists, 2011)

Antichain-Based QBF Solving. - Thomas Brihaye; Véronique Bruyère; Laurent Doyen 001; Marc Ducobu; Jean-François Raskin (ATVA, 2011)

On Memoryless Quantitative Objectives. - Krishnendu Chatterjee; Laurent Doyen 001; Rohit Singh 002 (FCT, 2011)

On Reachability for Hybrid Automata over Bounded Time. - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (ICALP (2), 2011)

Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives. - Krishnendu Chatterjee; Laurent Doyen 001 (MEMICS, 2011)

Energy and Mean-Payoff Parity Markov Decision Processes. - Krishnendu Chatterjee; Laurent Doyen 001 (MFCS, 2011)

Infinite Synchronizing Words for Probabilistic Automata. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (MFCS, 2011)

Synchronizing Objectives for Markov Decision Processes - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (iWIGP, 2011)

Faster algorithms for mean-payoff games. - Lubos Brim; Jakub Chaloupka; Laurent Doyen 001; Raffaella Gentilini; Jean-François Raskin (Formal Methods Syst. Des., 2011)

Infinite Synchronizing Words for Probabilistic Automata (Erratum) - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (CoRR, 2012)

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (CoRR, 2012)

Energy parity games. - Krishnendu Chatterjee; Laurent Doyen 001 (Theor. Comput. Sci., 2012)

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. - Thomas Brihaye; Laurent Doyen 001; Gilles Geeraerts; Joël Ouaknine; Jean-François Raskin; James Worrell 001 (ATVA, 2013)

A survey of partial-observation stochastic parity games. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Formal Methods Syst. Des., 2013)

Robust Synchronization in Markov Decision Processes. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (CONCUR, 2014)

Limit Synchronization in Markov Decision Processes. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (FoSSaCS, 2014)

Perfect-Information Stochastic Mean-Payoff Parity Games. - Krishnendu Chatterjee; Laurent Doyen 001; Hugo Gimbert; Youssouf Oualhadj (FoSSaCS, 2014)

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. - Krishnendu Chatterjee; Laurent Doyen 001; Sumit Nain; Moshe Y. Vardi (FoSSaCS, 2014)

Synchronizing Words for Weighted and Timed Automata. - Laurent Doyen 001; Line Juhl; Kim Guldstrand Larsen; Nicolas Markey; Mahsa Shirmohammadi (FSTTCS, 2014)

Games with a Weak Adversary. - Krishnendu Chatterjee; Laurent Doyen 001 (ICALP (2), 2014)

Partial-Observation Stochastic Games: How to Win when Belief Fails. - Krishnendu Chatterjee; Laurent Doyen 001 (ACM Trans. Comput. Log., 2014)

The Complexity of Synthesis from Probabilistic Components. - Krishnendu Chatterjee; Laurent Doyen 001; Moshe Y. Vardi (ICALP (2), 2015)

Randomness for free. - Krishnendu Chatterjee; Laurent Doyen 001; Hugo Gimbert; Thomas A. Henzinger (Inf. Comput., 2015)

Looking at mean-payoff and total-payoff through windows. - Krishnendu Chatterjee; Laurent Doyen 001; Mickael Randour; Jean-François Raskin (Inf. Comput., 2015)

The complexity of multi-mean-payoff and multi-energy games. - Yaron Velner; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Alexander Moshe Rabinovich; Jean-François Raskin (Inf. Comput., 2015)

Computation Tree Logic for Synchronization Properties. - Krishnendu Chatterjee; Laurent Doyen 001 (ICALP, 2016)

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. - Krishnendu Chatterjee; Laurent Doyen 001 (LICS, 2016)

The Cost of Exactness in Quantitative Reachability. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Models, Algorithms, Logics and Tools, 2017)

The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract). - Laurent Doyen 001 (RP, 2017)

Doomsday equilibria for omega-regular games. - Krishnendu Chatterjee; Laurent Doyen 001; Emmanuel Filiot; Jean-François Raskin (Inf. Comput., 2017)

Verification of Hybrid Systems. - Laurent Doyen 001; Goran Frehse; George J. Pappas; André Platzer (Handbook of Model Checking, 2018)

The complexity of synchronizing Markov decision processes. - Laurent Doyen 001; Thierry Massart; Mahsa Shirmohammadi (J. Comput. Syst. Sci., 2019)

Bounds for Synchronizing Markov Decision Processes. - Laurent Doyen 001; Marie van den Bogaard (CSR, 2022)

Stochastic Games with Synchronizing Objectives. - Laurent Doyen 001 (LICS, 2022)

Graph planning with expected finite horizon. - Krishnendu Chatterjee; Laurent Doyen 001 (J. Comput. Syst. Sci., 2022)

Synthesising Full-Information Protocols. - Dietmar Berwanger; Laurent Doyen 001; Thomas Soullard (CoRR, 2023)

Observation and Distinction: Representing Information in Infinite Games. - Dietmar Berwanger; Laurent Doyen 001 (Theory Comput. Syst., 2023)

Stochastic Games with Synchronization Objectives. - Laurent Doyen 001 (J. ACM, 2023)

Regular Games with Imperfect Information Are Not That Regular. - Laurent Doyen 001; Thomas Soullard (CONCUR, 2024)

Expectation in Stochastic Window Mean-Payoff Games. - Laurent Doyen 001; Pranshu Gaba; Shibashis Guha (CoRR, 2024)

Stochastic Processes with Expected Stopping Time. - Krishnendu Chatterjee; Laurent Doyen 001 (Log. Methods Comput. Sci., 2024)

Expectation in Stochastic Games with Prefix-Independent Objectives. - Laurent Doyen 001; Pranshu Gaba; Shibashis Guha (CONCUR, 2025)

The Value Problem for Multiple-Environment MDPs with Parity Objective. - Krishnendu Chatterjee; Laurent Doyen 001; Jean-François Raskin; Ocan Sankur (ICALP, 2025)

Top-down complementation of automata on finite trees. - Laurent Doyen 001 (Inf. Process. Lett., 2025)

Stochastic Window Mean-Payoff Games. - Laurent Doyen 001; Pranshu Gaba; Shibashis Guha (Log. Methods Comput. Sci., 2025)