| 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 | 115 | 2009 |
| 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 | 108 | 2007 |
| Improved undecidability results on weighted timed automata P Bouyer, T Brihaye, N Markey Information Processing Letters 98 (5), 188-194, 2006 | 98 | 2006 |
| On optimal timed strategies T Brihaye, V Bruyere, JF Raskin Formal Modeling and Analysis of Timed Systems: Third International …, 2005 | 86 | 2005 |
| When are timed automata determinizable? C Baier, N Bertrand, P Bouyer, T Brihaye Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009 | 78 | 2009 |
| Model-checking for weighted timed automata T Brihaye, V Bruyere, JF Raskin International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2004 | 78 | 2004 |
| Stochastic timed automata N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Größer, ... Logical methods in computer science 10, 2014 | 68 | 2014 |
| On o-minimal hybrid systems T Brihaye, C Michaux, R Cédric, T Christophe HSCC 2993, 219--233, 2004 | 67 | 2004 |
| 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 | 65 | 2007 |
| On the expressiveness and decidability of o-minimal hybrid systems T Brihaye, C Michaux Journal of complexity 21 (4), 447-478, 2005 | 59 | 2005 |
| 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 | 58 | 2008 |
| 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 | 57 | 2008 |
| Minimum-time reachability in timed games T Brihaye, TA Henzinger, VS Prabhu, JF Raskin International Colloquium on Automata, Languages, and Programming, 825-837, 2007 | 38 | 2007 |
| 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 | 37 | 2017 |
| Multiplayer cost games with simple Nash equilibria T Brihaye, J De Pril, S Schewe Logical Foundations of Computer Science: International Symposium, LFCS 2013 …, 2013 | 35 | 2013 |
| 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 | 34 | 2011 |
| 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 | 31 | 2020 |
| 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 | 29 | 2013 |
| O-minimal hybrid reachability games P Bouyer, T Brihaye, F Chevalier Logical Methods in Computer Science 6, 2010 | 28 | 2010 |
| Timed concurrent game structures T Brihaye, F Laroussinie, N Markey, G Oreiby International Conference on Concurrency Theory, 445-459, 2007 | 28 | 2007 |
Patricia BouyerLMF, Université Paris-Saclay, CNRS, ENS Paris-Saclaylsv.fr의 이메일 확인됨
