Travelled to:
1 × Estonia
1 × Germany
1 × Greece
1 × Poland
1 × Switzerland
2 × USA
Collaborated with:
P.Bouyer N.Bertrand J.Raskin V.Bruyère C.Baier G.Geeraerts F.Chevalier N.Meunier J.D.Pril H.Gimbert A.Stainer T.A.Henzinger V.S.Prabhu H.Ho B.Monmege M.Größer L.Doyen J.Ouaknine J.Worrell
Talks about:
time (7) automata (5) reachabl (4) equilibria (2) quantit (2) perfect (2) subgam (2) hybrid (2) game (2) determiniz (1)
Person: Thomas Brihaye
DBLP: Brihaye:Thomas
Contributed to:
Wrote 9 papers:
- CSL-2015-BrihayeBMR #reachability
- Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability (TB, VB, NM, JFR), pp. 504–518.
- FoSSaCS-2012-BrihayeBPG #game studies #reachability
- Subgame Perfection for Equilibria in Quantitative Reachability Games (TB, VB, JDP, HG), pp. 286–300.
- ICALP-v2-2011-BertrandBBS #automaton #problem
- Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.
- ICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #on the #reachability
- On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
- ICALP-v2-2009-BaierBBB #automaton #question
- When Are Timed Automata Determinizable? (CB, NB, PB, TB), pp. 43–54.
- LICS-2008-BaierBBBG #automaton #infinity #model checking
- Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.
- ICALP-2007-BrihayeHPR #game studies #reachability
- Minimum-Time Reachability in Timed Games (TB, TAH, VSP, JFR), pp. 825–837.
- LICS-2006-BouyerBC #hybrid
- Control in o-minimal Hybrid Systems (PB, TB, FC), pp. 367–378.
- CAV-2017-BrihayeGHM #automaton #composition #named
- MightyL: A Compositional Translation from MITL to Timed Automata (TB, GG, HMH, BM), pp. 421–440.