Model-Checking for Weighted Timed Automata. - Thomas Brihaye; Véronique Bruyère; Jean-François Raskin (FORMATS/FTRTFT, 2004)

On O-Minimal Hybrid Systems. - Thomas Brihaye; Christian Michaux; Cédric Rivière; Christophe Troestler (HSCC, 2004)

On Optimal Timed Strategies. - Thomas Brihaye; Véronique Bruyère; Jean-François Raskin (FORMATS, 2005)

On the expressiveness and decidability of o-minimal hybrid systems. - Thomas Brihaye; Christian Michaux (J. Complex., 2005)

Control in o-minimal Hybrid Systems. - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (LICS, 2006)

On model-checking timed automata with stopwatch observers. - Thomas Brihaye; Véronique Bruyère; Jean-François Raskin (Inf. Comput., 2006)

Improved undecidability results on weighted timed automata. - Patricia Bouyer; Thomas Brihaye; Nicolas Markey (Inf. Process. Lett., 2006)

Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]. - Thomas Brihaye; Christian Michaux (J. Complex., 2006)

A note on the undecidability of the reachability problem for o-minimal dynamical systems. - Thomas Brihaye (Math. Log. Q., 2006)

Timed Concurrent Game Structures. - Thomas Brihaye; François Laroussinie; Nicolas Markey; Ghassan Oreiby (CONCUR, 2007)

Probabilistic and Topological Semantics for Timed Automata. - Christel Baier; Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Marcus Größer (FSTTCS, 2007)

Minimum-Time Reachability in Timed Games. - Thomas Brihaye; Thomas A. Henzinger; Vinayak S. Prabhu; Jean-François Raskin (ICALP, 2007)

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (LFCS, 2007)

Words and Bisimulations of Dynamical Systems. - Thomas Brihaye (Discret. Math. Theor. Comput. Sci., 2007)

On the optimal reachability problem of weighted timed automata. - Patricia Bouyer; Thomas Brihaye; Véronique Bruyère; Jean-François Raskin (Formal Methods Syst. Des., 2007)

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. - Patricia Bouyer; Thomas Brihaye; Marcin Jurdzinski; Ranko Lazic 001; Michal Rutkowski (FORMATS, 2008)

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. - Christel Baier; Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Marcus Größer (LICS, 2008)

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Nicolas Markey (QEST, 2008)

Good Friends are Hard to Find! - Thomas Brihaye; Nicolas Markey; Mohamed Ghannem; Lionel Rieg (TIME, 2008)

When Are Timed Automata Determinizable? - Christel Baier; Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye (ICALP (2), 2009)

ATL with Strategy Contexts and Bounded Memory. - Thomas Brihaye; Arnaud Da Costa Lopes; François Laroussinie; Nicolas Markey (LFCS, 2009)

Weighted o-minimal hybrid systems. - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (Ann. Pure Appl. Log., 2009)

Cell decomposition and dimension function in the theory of closed ordered differential fields. - Thomas Brihaye; Christian Michaux; Cédric Rivière (Ann. Pure Appl. Log., 2009)

Equilibria in Quantitative Reachability Games. - Thomas Brihaye; Véronique Bruyère; Julie De Pril (CSR, 2010)

O-Minimal Hybrid Reachability Games - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (Log. Methods Comput. Sci., 2010)

Using Model Checking for Analyzing Distributed Power Control Problems. - Thomas Brihaye; Marc Jungers; Samson Lasaulce; Nicolas Markey; Ghassan Oreiby (EURASIP J. Wirel. Commun. Netw., 2010)

Formal language properties of hybrid systems with strong resets. - Thomas Brihaye; Véronique Bruyère; Elaine Render (RAIRO Theor. Informatics Appl., 2010)

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

Emptiness and Universality Problems in Timed Automata with Positive Frequency. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Amélie Stainer (ICALP (2), 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)

Subgame Perfection for Equilibria in Quantitative Reachability Games. - Thomas Brihaye; Véronique Bruyère; Julie De Pril; Hugo Gimbert (FoSSaCS, 2012)

Almost-Sure Model-Checking of Reactive Timed Automata. - Patricia Bouyer; Thomas Brihaye; Marcin Jurdzinski; Quentin Menet (QEST, 2012)

On Subgame Perfection in Quantitative Reachability Games - Thomas Brihaye; Véronique Bruyère; Julie De Pril; Hugo Gimbert (Log. Methods Comput. Sci., 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)

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)

On MITL and Alternating Timed Automata. - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts (FORMATS, 2013)

Multiplayer Cost Games with Simple Nash Equilibria. - Thomas Brihaye; Julie De Pril; Sven Schewe (LFCS, 2013)

Fairly Correct Systems: Beyond omega-regularity - Thomas Brihaye; Quentin Menet (GandALF, 2013)

Adding Negative Prices to Priced Timed Games. - Thomas Brihaye; Gilles Geeraerts; Shankara Narayanan Krishna; Lakshmi Manasa; Benjamin Monmege; Ashutosh Trivedi 001 (CONCUR, 2014)

On MITL and Alternating Timed Automata over Infinite Words. - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts (FORMATS, 2014)

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. - Nathalie Bertrand 001; Thomas Brihaye; Blaise Genest (QEST, 2014)

Stochastic Timed Automata. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Quentin Menet; Christel Baier; Marcus Größer; Marcin Jurdzinski (Log. Methods Comput. Sci., 2014)

On Equilibria in Quantitative Games with Reachability/Safety Objectives. - Thomas Brihaye; Véronique Bruyère; Julie De Pril (Theory Comput. Syst., 2014)

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (CONCUR, 2015)

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. - Thomas Brihaye; Véronique Bruyère; Noémie Meunier; Jean-François Raskin (CSL, 2015)

Simple Priced Timed Games are not That Simple. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (FSTTCS, 2015)

Quantitative Games under Failures. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege; Guillermo A. Pérez 001; Gabriel Renault (FSTTCS, 2015)

Simple strategies for Banach-Mazur games and sets of probability 1. - Thomas Brihaye; Axel Haddad; Quentin Menet (Inf. Comput., 2015)

Compositional Design of Stochastic Timed Automata. - Patricia Bouyer; Thomas Brihaye; Pierre Carlier; Quentin Menet (CSR, 2016)

Real-Time Synthesis is Hard! - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege; Nathalie Sznajder (FORMATS, 2016)

Analysing Decisive Stochastic Processes. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Pierre Carlier (ICALP, 2016)

Efficient Energy Distribution in a Smart Grid using Multi-Player Games. - Thomas Brihaye; Amit Kumar Dhar; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Cassting/SynCoP, 2016)

MightyL: A Compositional Translation from MITL to Timed Automata. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege (CAV (1), 2017)

Timed-Automata-Based Verification of MITL over Signals. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege (TIME, 2017)

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Acta Informatica, 2017)

Dynamics and Coalitions in Sequential Games. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Stéphane Le Roux 001 (GandALF, 2017)

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Arthur Milchior; Benjamin Monmege (ICECCS, 2018)

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin (CoRR, 2018)

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin (GandALF, 2018)

When are stochastic transition systems tameable? - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Pierre Carlier (J. Log. Algebraic Methods Program., 2018)

Dynamics on Games: Simulation-Based Techniques and Applications to Routing. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Benjamin Monmege; Bruno Quoitin (FSTTCS, 2019)

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin; Marie van den Bogaard (CoRR, 2019)

On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games. - Thomas Brihaye; Aline Goeminne (FORMATS, 2020)

Decisiveness of Stochastic Systems and its Application to Hybrid Models. - Patricia Bouyer; Thomas Brihaye; Mickael Randour; Cédric Rivière; Pierre Vandenhove (GandALF, 2020)

Taming denumerable Markov decision processes with decisiveness. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Paulin Fournier (CoRR, 2020)

One-Clock Priced Timed Games with Arbitrary Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (CoRR, 2020)

Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version). - Patricia Bouyer; Thomas Brihaye; Mickael Randour; Cédric Rivière; Pierre Vandenhove (CoRR, 2020)

On the termination of dynamics in sequential games. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Stéphane Le Roux 001 (Inf. Comput., 2020)

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin; Marie van den Bogaard (Log. Methods Comput. Sci., 2020)

Life is Random, Time is Not: Markov Decision Processes with Window Objectives. - Thomas Brihaye; Florent Delgrange; Youssouf Oualhadj; Mickael Randour (Log. Methods Comput. Sci., 2020)

Preface. - Mikolaj Bojanczyk; Thomas Brihaye; Christoph Haase; Slawomir Lasota 001; Joël Ouaknine; Igor Potapov (Inf. Comput., 2021)

Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Jean-François Raskin (Inf. Comput., 2021)

On relevant equilibria in reachability games. - Thomas Brihaye; Véronique Bruyère; Aline Goeminne; Nathan Thomasset (J. Comput. Syst. Sci., 2021)

Towards Decentralized Models for Day-Ahead Scheduling of Energy Resources in Renewable Energy Communities. - Louise Sadoine; Martin Hupez; Zacharie De Grève; Thomas Brihaye (OR, 2022)

Adversarial Formal Semantics of Attack Trees and Related Problems. - Thomas Brihaye; Sophie Pinchinat; Alexandre Terefenko (GandALF, 2022)

One-Clock Priced Timed Games with Negative Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (Log. Methods Comput. Sci., 2022)

Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque. - Thomas Brihaye; Sophie Pinchinat; Alexandre Terefenko (CNIA, 2023)

Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). - Thomas Brihaye; Aline Goeminne; James C. A. Main; Mickael Randour (FSTTCS, 2023)

Impact of retail electricity prices and grid tariff structure on the operation of resources scheduling in Renewable Energy Communities. - Louise Sadoine; Zacharie De Grève; Thomas Brihaye (ISGT EUROPE, 2023)

Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. - Thomas Brihaye; Véronique Bruyère; Gaspard Reghem (RP, 2023)

Multi-weighted Reachability Games. - Thomas Brihaye; Aline Goeminne (RP, 2023)

Valuing the Electricity Produced Locally in Renewable Energy Communities through Noncooperative Resources Scheduling Games. - Louise Sadoine; Zacharie De Grève; Thomas Brihaye (CoRR, 2023)

Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. - Thomas Brihaye; Sophie Pinchinat; Alexandre Terefenko (LATIN (2), 2024)

Risk-aware Markov Decision Processes Using Cumulative Prospect Theory. - Thomas Brihaye; Krishnendu Chatterjee; Stefanie Mohr; Maximilian Weininger (CoRR, 2025)