Thomas Brihaye

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 55

Top Venues

Publications

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

Thomas Brihaye.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Brihaye