Suivre
Thomas Brihaye
Thomas Brihaye
UMONS
Adresse e-mail validée de umons.ac.be
Titre
Citée par
Citée par
Année
ATL with Strategy Contexts and Bounded Memory
T Brihaye, A Da Costa, F Laroussinie, N Markey
Logical Foundations of Computer Science: International Symposium, LFCS 2009 …, 2009
1172009
On the optimal reachability problem of weighted timed automata
P Bouyer, T Brihaye, V Bruyere, JF Raskin
Formal Methods in System Design 31 (2), 135-175, 2007
1042007
Improved undecidability results on weighted timed automata
P Bouyer, T Brihaye, N Markey
Information Processing Letters 98 (5), 188-194, 2006
932006
On optimal timed strategies
T Brihaye, V Bruyere, JF Raskin
FORMATS 5, 49-64, 2005
792005
Model-checking for weighted timed automata
T Brihaye, V Bruyere, JF Raskin
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant …, 2004
792004
When are timed automata determinizable?
C Baier, N Bertrand, P Bouyer, T Brihaye
Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009
712009
On o-minimal hybrid systems
T Brihaye, C Michaux, R Cédric, T Christophe
HSCC 2993, 219--233, 2004
682004
Probabilistic and topological semantics for timed automata
C Baier, N Bertrand, P Bouyer, T Brihaye, M Größer
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer …, 2007
642007
Stochastic timed automata
N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Größer, ...
arXiv preprint arXiv:1410.2128, 2014
602014
On the expressiveness and decidability of o-minimal hybrid systems
T Brihaye, C Michaux
Journal of complexity 21 (4), 447-478, 2005
592005
Almost-sure model checking of infinite paths in one-clock timed automata
C Baier, N Bertrand, P Bouyer, T Brihaye, M GröBer
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 217-226, 2008
582008
Quantitative model-checking of one-clock timed automata under probabilistic semantics
N Bertrand, P Bouyer, T Brihaye, N Markey
2008 Fifth International Conference on Quantitative Evaluation of Systems, 55-64, 2008
572008
Minimum-time reachability in timed games
T Brihaye, TA Henzinger, VS Prabhu, JF Raskin
Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007
382007
MightyL: A Compositional Translation from MITL to Timed Automata
T Brihaye, G Geeraerts, HM Ho, B Monmege
Computer Aided Verification: 29th International Conference, CAV 2017 …, 2017
322017
On (subgame perfect) secure equilibrium in quantitative reachability games
T Brihaye, V Bruyère, J De Pril, H Gimbert
arXiv preprint arXiv:1205.6346, 2012
322012
On reachability for hybrid automata over bounded time
T Brihaye, L Doyen, G Geeraerts, J Ouaknine, JF Raskin, J Worrell
Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011
322011
Multiplayer Cost Games with Simple Nash Equilibria.
T Brihaye, J De Pril, S Schewe
LFCS 2013, 59-73, 2013
292013
O-minimal hybrid reachability games
P Bouyer, T Brihaye, F Chevalier
arXiv preprint arXiv:0911.4833, 2009
292009
Control in o-minimal hybrid systems
P Bouyer, T Brihaye, F Chevalier
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 367-378, 2006
282006
The complexity of subgame perfect equilibria in quantitative reachability games
T Brihaye, V Bruyère, A Goeminne, JF Raskin, M Van den Bogaard
Logical Methods in Computer Science 16, 2020
262020
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20