Thèmes de recherche

Nos principales activités de recherche sont:

Vérification de systèmes temporisés et hybrides
Contrôle de systèmes temporisés et hybrides
Théorie des jeux et ses applications à la vérification CASSTING project
Conception d'algorithmes efficaces pour la vérification (basés sur les antichaînes)
Application de la théorie des jeux à la microfinance MIGA project

Publications

N'hésitez pas à nous envoyer un e-mail si vous souhaitez obtenir une copie .pdf de l'un des articles ci-dessous!

Thomas Brihaye, Julie De Pril, Sven Schewe, Multiplayer Cost Games with Simple Nash Equilibria, LFCS'13.

Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet, Almost-Sure Model-Checking of Reactive Timed Automata, QEST'12.
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert, Subgame Perfection for Equilibria in Quantitative Reachability Games, FOSSACS'12.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer, Emptiness and Universality Problems in Timed Automata with Positive Frequency, ICALP'11.
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell, On Reachability for Hybrid Automata over Bounded Time, ICALP'11.
Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin, Antichain-based QBF Solving, ATVA'11.

Thomas Brihaye, Véronique Bruyère, Julie De Pril, Equilibria in quantitative reachability games, CSR'10.
Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nicolas Markey, Ghassan Oreiby, Using Model Checking for Analyzing Distributed Power Control Problems, EURASIP Journal on Wireless Communications and Networking.
Thomas Brihaye, Véronique Bruyère, Elaine Render, Formal languages properties of o-minimal hybrid systems., RAIRO.

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, When are timed automata determinizable ?, ICALP'09.
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier, O-Minimal Hybrid Reachability Games. Logical Methods in Computer Science.
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier, Weighted O-Minimal Hybrid Systems. Annals of Pure and Applied Logics.
Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey, ATL with Strategy Contexts and Bounded Memory., LFCS'09.
Thomas Brihaye, Christian Michaux, Cédric Rivière, Cell decomposition and dimension function in theory of closed ordered differential fields., Annals of Pure and Applied Logics.

Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski, Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets., FORMATS'08.
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye and Nicolas Markey, Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics., QEST'08.
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer, Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata, LICS'08.
Thomas Brihaye, Mohamed Ghannem, Nicolas Markey, Lionel Rieg, Good friends are hard to find!, TIME'08.

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer, Probabilistic and Topological Semantics for Timed Automata, FSTTCS'07.
Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin, On the optimal reachability problem on weighted timed automata, Formal Methods in System Design.
Thomas Brihaye, Words and bisimulation of dynamical systems, Discrete Mathematics & Theoretical Computer Science.
Thomas Brihaye, Thomas A. Henzinger, Vinayak Prabhu, Jean-François Raskin, Minimum-time reachability in timed games, ICALP'07.
Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby, Timed Concurrent Game Structures, CONCUR'07.
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier, Weighted O-Minimal Hybrid Systems are more Decidable than Weighted Timed Automata!, LFCS'07.

Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier, Control in o-Minimal Hybrid Systems, LICS'06.
Patricia Bouyer, Thomas Brihaye, Nicolas Markey, Improved Undecidability Results on Weighted Timed Automata, Information Processing Letters.
Thomas Brihaye, A note on the undecidability of the reachability problem for o-minimal dynamical systems, Mathematical Logic Quarterly.
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin, On Model-Checking Timed Automata with Stopwatch Observers, Information and Computation.

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin, On Optimal Timed Strategies, FORMATS'05.
Thomas Brihaye, Christian Michaux, On the expressiveness and decidability of o-minimal hybrid systems, Journal of Complexity.

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin, Model-Checking for Weighted Timed Automata, FORMATS-FTRTFT'04.
Thomas Brihaye, Christian Michaux, Cédric Rivière, Christophe Troestler, On o-minimal hybrid systems, HSCC'04.