Thomas Brihaye

Cited by

	All	Since 2018
Citations	1715	592
h-index	23	13
i10-index	45	18

140

105

200520062007200820092010201120122013201420152016201720182019202020212022202317 59 48 73 124 82 103 78 104 107 115 79 105 115 78 83 109 138 67

Public access

View all

21 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Patricia BouyerLMF, Université Paris-Saclay, CNRS, ENS Paris-SaclayVerified email at lsv.fr
Veronique BruyereUniversity of MonsVerified email at umons.ac.be
Gilles GeeraertsAssociate Prof. of Computer Science, Université libre de Bruxelles (ULB)Verified email at ulb.be
Jean-François RaskinUniversité Libre de Bruxelles, U.L.B.Verified email at ulb.ac.be
Nathalie BertrandUniv Rennes, Inria, CNRS, IRISAVerified email at inria.fr
Benjamin MonmegeAssistant Professor, Aix-Marseille Université, Laboratoire d'Informatique et SystèmesVerified email at univ-amu.fr
Nicolas MarkeyCNRS, IRISA, Univ. Rennes, FranceVerified email at irisa.fr
Christel BaierTU DresdenVerified email at tu-dresden.de
Axel HaddadPostdoctoral Researcher, Effective Mathematics Team, Mons University, BelgiumVerified email at umons.ac.be
cedric riviereUniversity of MonsVerified email at umons.ac.be
Christian MichauxUMONSVerified email at umons.ac.be
Quentin MenetUniversité de MonsVerified email at umons.ac.be
Aline GoeminneUMONS &ULBVerified email at umons.ac.be
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Hsi-Ming HoUniversity of SussexVerified email at sussex.ac.uk
Laurent DoyenCNRS - LMF, ENS Paris-SaclayVerified email at lsv.fr
James WorrellProfessor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Joel OuaknineDirector, Max Planck Institute for Software Systems (MPI-SWS), Saarland Informatics CampusVerified email at mpi-sws.org
Hugo Gimbertchargé de recherche au CNRS, LaBRI, BordeauxVerified email at labri.fr
Engel LefaucheuxMPI-SWSVerified email at mpi-sws.org

Thomas Brihaye

UMONS

Verified email at umons.ac.be


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	117	2009
On the optimal reachability problem of weighted timed automata P Bouyer, T Brihaye, V Bruyere, JF Raskin Formal Methods in System Design 31, 135-175, 2007	104	2007
Improved undecidability results on weighted timed automata P Bouyer, T Brihaye, N Markey Information Processing Letters 98 (5), 188-194, 2006	94	2006
On optimal timed strategies T Brihaye, V Bruyere, JF Raskin Formal Modeling and Analysis of Timed Systems: Third International …, 2005	79	2005
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
When are timed automata determinizable? C Baier, N Bertrand, P Bouyer, T Brihaye Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009	73	2009
On o-minimal hybrid systems T Brihaye, C Michaux, R Cédric, T Christophe HSCC 2993, 219--233, 2004	68	2004
Stochastic timed automata N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Größer, ... Logical methods in computer science 10, 2014	64	2014
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	64	2007
On the expressiveness and decidability of o-minimal hybrid systems T Brihaye, C Michaux Journal of complexity 21 (4), 447-478, 2005	60	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	37	2007
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	33	2011
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	31	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	31	2013
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	30	2013
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	29	2020
O-minimal hybrid reachability games P Bouyer, T Brihaye, F Chevalier Logical Methods in Computer Science 6, 2010	29	2010
Timed concurrent game structures T Brihaye, F Laroussinie, N Markey, G Oreiby International Conference on Concurrency Theory, 445-459, 2007	27	2007

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors