Thomas Brihaye

111 papers A* 5B 10C 2Misc 5Journal 54Unranked 34
YearRankTypeTitle / Venue / Authors
2025 — conf
Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs.
Principles of Formal Quantitative Analysis
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier, Pierre Vandenhove
2025 A* conf
Risk-aware Markov Decision Processes Using Cumulative Prospect Theory.
LICS
Thomas Brihaye, Krishnendu Chatterjee, Stefanie Mohr, Maximilian Weininger
2025 J jnl
Risk-aware Markov Decision Processes Using Cumulative Prospect Theory.
CoRR
Thomas Brihaye, Krishnendu Chatterjee, Stefanie Mohr, Maximilian Weininger
2024 — conf
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages.
LATIN (2)
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2023 — conf
Impact of retail electricity prices and grid tariff structure on the operation of resources scheduling in Renewable Energy Communities.
ISGT EUROPE
Louise Sadoine, Zacharie De Grève, Thomas Brihaye
2023 J jnl
Multi-Weighted Reachability Games.
CoRR
Thomas Brihaye, Aline Goeminne
2023 — conf
Multi-weighted Reachability Games.
RP
Thomas Brihaye, Aline Goeminne
2023 — conf
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete.
RP
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
2023 J jnl
Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete.
CoRR
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
2023 — conf
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk).
FSTTCS
Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour
2023 J jnl
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages.
CoRR
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2023 — conf
Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque.
CNIA
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2023 J jnl
Valuing the Electricity Produced Locally in Renewable Energy Communities through Noncooperative Resources Scheduling Games.
CoRR
Louise Sadoine, Zacharie De Grève, Thomas Brihaye
2022 — conf
Adversarial Formal Semantics of Attack Trees and Related Problems.
GandALF
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2022 J jnl
Decisiveness of stochastic systems and its application to hybrid models.
Inf. Comput.
Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove
2022 J jnl
One-Clock Priced Timed Games with Negative Weights.
Log. Methods Comput. Sci.
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2022 — conf
Towards Decentralized Models for Day-Ahead Scheduling of Energy Resources in Renewable Energy Communities.
OR
Louise Sadoine, Martin Hupez, Zacharie De Grève, Thomas Brihaye
2021 J jnl
Constrained existence problem for weak subgame perfect equilibria with
Inf. Comput.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2021 J jnl
On relevant equilibria in reachability games.
J. Comput. Syst. Sci.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
2021 J jnl
Preface.
Inf. Comput.
Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov
2020 J jnl
Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version).
CoRR
Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove
2020 — conf
Decisiveness of Stochastic Systems and its Application to Hybrid Models.
GandALF
Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove
2020 J jnl
Life is Random, Time is Not: Markov Decision Processes with Window Objectives.
Log. Methods Comput. Sci.
Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour
2020 — conf
On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games.
FORMATS
Thomas Brihaye, Aline Goeminne
2020 J jnl
On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games.
CoRR
Thomas Brihaye, Aline Goeminne
2020 J jnl
On the termination of dynamics in sequential games.
Inf. Comput.
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux
2020 J jnl
One-Clock Priced Timed Games with Arbitrary Weights.
CoRR
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2020 J jnl
Taming denumerable Markov decision processes with decisiveness.
CoRR
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier
2020 J jnl
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
Log. Methods Comput. Sci.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2019 — conf
Dynamics on Games: Simulation-Based Techniques and Applications to Routing.
FSTTCS
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
2019 J jnl
Dynamics on Games: Simulation-Based Techniques and Applications to Routing.
CoRR
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
2019 B conf
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives.
CONCUR
Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour
2019 J jnl
Life is Random, Time is Not: Markov Decision Processes with Window Objectives.
CoRR
Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour
2019 — conf
On Relevant Equilibria in Reachability Games.
RP
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
2019 J jnl
On Relevant Equilibria in Reachability Games.
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
2019 J jnl
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version).
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2019 B conf
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
CONCUR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2018 — conf
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives.
GandALF
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2018 J jnl
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives.
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2018 B conf
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis.
ICECCS
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege
2018 J jnl
When are stochastic transition systems tameable?
J. Log. Algebraic Methods Program.
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier
2017 — conf
Dynamics and Coalitions in Sequential Games.
GandALF
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux
2017 — conf
MightyL: A Compositional Translation from MITL to Timed Automata.
CAV (1)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2017 J jnl
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.
Acta Informatica
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2017 C conf
Timed-Automata-Based Verification of MITL over Signals.
TIME
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2017 J jnl
When are Stochastic Transition Systems Tameable?
CoRR
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier
2016 A* conf
Analysing Decisive Stochastic Processes.
ICALP
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier
2016 Misc conf
Compositional Design of Stochastic Timed Automata.
CSR
Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet
2016 — conf
Efficient Energy Distribution in a Smart Grid using Multi-Player Games.
Cassting/SynCoP
Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2016 — ed.
Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, Cassting/SynCoP 2016, Eindhoven, The Netherlands, April 2-3, 2016.
Cassting/SynCoP
Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, Jirí Srba
2016 — conf
Real-Time Synthesis is Hard!
FORMATS
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
2016 J jnl
Real-Time Synthesis is Hard!
CoRR
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
2015 — conf
Quantitative Games under Failures.
FSTTCS
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015 J jnl
Quantitative Games under Failures.
CoRR
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015 J jnl
Simple Priced Timed Games Are Not That Simple.
CoRR
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2015 — conf
Simple Priced Timed Games are not That Simple.
FSTTCS
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2015 J jnl
Simple strategies for Banach-Mazur games and sets of probability 1.
Inf. Comput.
Thomas Brihaye, Axel Haddad, Quentin Menet
2015 B conf
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
CONCUR
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2015 B conf
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CSL
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2015 J jnl
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CoRR
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2014 B conf
Adding Negative Prices to Priced Timed Games.
CONCUR
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014 J jnl
Adding Negative Prices to Priced Timed Games.
CoRR
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014 — conf
Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.
QEST
Nathalie Bertrand, Thomas Brihaye, Blaise Genest
2014 J jnl
On Equilibria in Quantitative Games with Reachability/Safety Objectives.
Theory Comput. Syst.
Thomas Brihaye, Véronique Bruyère, Julie De Pril
2014 — conf
On MITL and Alternating Timed Automata over Infinite Words.
FORMATS
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2014 J jnl
On MITL and alternating timed automata over infinite words.
CoRR
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2014 J jnl
Stochastic Timed Automata.
Log. Methods Comput. Sci.
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski
2014 J jnl
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
CoRR
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2013 J jnl
Emptiness and Universality Problems in Timed Automata with Positive Frequency.
CoRR
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
2013 — conf
Fairly Correct Systems: Beyond omega-regularity
GandALF
Thomas Brihaye, Quentin Menet
2013 Misc conf
Multiplayer Cost Games with Simple Nash Equilibria.
LFCS
Thomas Brihaye, Julie De Pril, Sven Schewe
2013 — conf
On MITL and Alternating Timed Automata.
FORMATS
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2013 J jnl
On MITL and alternating timed automata
CoRR
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
2013 B conf
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
ATVA
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2012 — conf
Almost-Sure Model-Checking of Reactive Timed Automata.
QEST
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet
2012 J jnl
Multiplayer Cost Games with Simple Nash Equilibria
CoRR
Thomas Brihaye, Julie De Pril, Sven Schewe
2012 J jnl
On Equilibria in Quantitative Games with Reachability/Safety Objectives
CoRR
Thomas Brihaye, Véronique Bruyère, Julie De Pril
2012 J jnl
On Subgame Perfection in Quantitative Reachability Games
Log. Methods Comput. Sci.
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
2012 B conf
Subgame Perfection for Equilibria in Quantitative Reachability Games.
FoSSaCS
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
2012 J jnl
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
CoRR
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011 B conf
Antichain-Based QBF Solving.
ATVA
Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin
2011 — conf
Emptiness and Universality Problems in Timed Automata with Positive Frequency.
ICALP (2)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
2011 J jnl
On Reachability for Hybrid Automata over Bounded Time
CoRR
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2011 — conf
On Reachability for Hybrid Automata over Bounded Time.
ICALP (2)
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell
2010 Misc conf
Equilibria in Quantitative Reachability Games.
CSR
Thomas Brihaye, Véronique Bruyère, Julie De Pril
2010 J jnl
Formal language properties of hybrid systems with strong resets.
RAIRO Theor. Informatics Appl.
Thomas Brihaye, Véronique Bruyère, Elaine Render
2010 J jnl
O-Minimal Hybrid Reachability Games
Log. Methods Comput. Sci.
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
2010 J jnl
Using Model Checking for Analyzing Distributed Power Control Problems.
EURASIP J. Wirel. Commun. Netw.
Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nicolas Markey, Ghassan Oreiby
2009 Misc conf
ATL with Strategy Contexts and Bounded Memory.
LFCS
Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey
2009 J jnl
Cell decomposition and dimension function in the theory of closed ordered differential fields.
Ann. Pure Appl. Log.
Thomas Brihaye, Christian Michaux, Cédric Rivière
2009 J jnl
Weighted o-minimal hybrid systems.
Ann. Pure Appl. Log.
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
2009 — conf
When Are Timed Automata Determinizable?
ICALP (2)
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye
2008 A* conf
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
LICS
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
2008 — conf
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.
FORMATS
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
2008 C conf
Good Friends are Hard to Find!
TIME
Thomas Brihaye, Nicolas Markey, Mohamed Ghannem, Lionel Rieg
2008 — conf
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
QEST
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey
2007 A* conf
Minimum-Time Reachability in Timed Games.
ICALP
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
2007 J jnl
On the optimal reachability problem of weighted timed automata.
Formal Methods Syst. Des.
Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2007 — conf
Probabilistic and Topological Semantics for Timed Automata.
FSTTCS
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
2007 B conf
Timed Concurrent Game Structures.
CONCUR
Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby
2007 Misc conf
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
2007 J jnl
Words and Bisimulations of Dynamical Systems.
Discret. Math. Theor. Comput. Sci.
Thomas Brihaye
2006 J jnl
A note on the undecidability of the reachability problem for o-minimal dynamical systems.
Math. Log. Q.
Thomas Brihaye
2006 A* conf
Control in o-minimal Hybrid Systems.
LICS
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
2006 J jnl
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478].
J. Complex.
Thomas Brihaye, Christian Michaux
2006 J jnl
Improved undecidability results on weighted timed automata.
Inf. Process. Lett.
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
2006 J jnl
On model-checking timed automata with stopwatch observers.
Inf. Comput.
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2005 — conf
On Optimal Timed Strategies.
FORMATS
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2005 J jnl
On the expressiveness and decidability of o-minimal hybrid systems.
J. Complex.
Thomas Brihaye, Christian Michaux
2004 — conf
Model-Checking for Weighted Timed Automata.
FORMATS/FTRTFT
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2004 — conf
On O-Minimal Hybrid Systems.
HSCC
Thomas Brihaye, Christian Michaux, Cédric Rivière, Christophe Troestler