Folgen
Thomas Brihaye
Thomas Brihaye
UMONS
Bestätigte E-Mail-Adresse bei umons.ac.be
Titel
Zitiert von
Zitiert von
Jahr
ATL with strategy contexts and bounded memory
T Brihaye, A Da Costa, F Laroussinie, N Markey
International symposium on logical foundations of computer science, 92-106, 2009
1152009
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
1082007
Improved undecidability results on weighted timed automata
P Bouyer, T Brihaye, N Markey
Information Processing Letters 98 (5), 188-194, 2006
982006
On optimal timed strategies
T Brihaye, V Bruyere, JF Raskin
Formal Modeling and Analysis of Timed Systems: Third International …, 2005
862005
When are timed automata determinizable?
C Baier, N Bertrand, P Bouyer, T Brihaye
Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009
782009
Model-checking for weighted timed automata
T Brihaye, V Bruyere, JF Raskin
International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2004
782004
Stochastic timed automata
N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Größer, ...
Logical methods in computer science 10, 2014
722014
On o-minimal hybrid systems
T Brihaye, C Michaux, R Cédric, T Christophe
HSCC 2993, 219--233, 2004
672004
Probabilistic and topological semantics for timed automata
C Baier, N Bertrand, P Bouyer, T Brihaye, M Größer
International Conference on Foundations of Software Technology and …, 2007
662007
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
MightyL: A Compositional Translation from MITL to Timed Automata
T Brihaye, G Geeraerts, HM Ho, B Monmege
International Conference on Computer Aided Verification, 421-440, 2017
382017
Minimum-time reachability in timed games
T Brihaye, TA Henzinger, VS Prabhu, JF Raskin
International Colloquium on Automata, Languages, and Programming, 825-837, 2007
382007
Multiplayer cost games with simple Nash equilibria
T Brihaye, J De Pril, S Schewe
Logical Foundations of Computer Science: International Symposium, LFCS 2013 …, 2013
352013
On reachability for hybrid automata over bounded time
T Brihaye, L Doyen, G Geeraerts, J Ouaknine, JF Raskin, J Worrell
International Colloquium on Automata, Languages, and Programming, 416-427, 2011
342011
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
322020
Timed concurrent game structures
T Brihaye, F Laroussinie, N Markey, G Oreiby
International Conference on Concurrency Theory, 445-459, 2007
302007
On (subgame perfect) secure equilibrium in quantitative reachability games
T Brihaye, V Bruyère, J De Pril, H Gimbert
Logical Methods in Computer Science 9, 2013
292013
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
T Brihaye, G Geeraerts, A Haddad, B Monmege
Acta Informatica 54, 85-125, 2017
282017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20