2009 |
19 | EE | Thomas Brihaye,
Arnaud Da Costa Lopes,
François Laroussinie,
Nicolas Markey:
ATLwith Strategy Contexts and Bounded Memory.
LFCS 2009: 92-106 |
2008 |
18 | EE | Patricia Bouyer,
Thomas Brihaye,
Marcin Jurdzinski,
Ranko Lazic,
Michal Rutkowski:
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.
FORMATS 2008: 63-77 |
17 | EE | Christel Baier,
Nathalie Bertrand,
Patricia Bouyer,
Thomas Brihaye,
Marcus Größer:
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
LICS 2008: 217-226 |
16 | EE | Nathalie Bertrand,
Patricia Bouyer,
Thomas Brihaye,
Nicolas Markey:
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
QEST 2008: 55-64 |
15 | EE | Thomas Brihaye,
Nicolas Markey,
Mohamed Ghannem,
Lionel Rieg:
Good Friends are Hard to Find!
TIME 2008: 32-40 |
2007 |
14 | EE | Thomas Brihaye,
François Laroussinie,
Nicolas Markey,
Ghassan Oreiby:
Timed Concurrent Game Structures.
CONCUR 2007: 445-459 |
13 | EE | Christel Baier,
Nathalie Bertrand,
Patricia Bouyer,
Thomas Brihaye,
Marcus Größer:
Probabilistic and Topological Semantics for Timed Automata.
FSTTCS 2007: 179-191 |
12 | EE | Thomas Brihaye,
Thomas A. Henzinger,
Vinayak S. Prabhu,
Jean-François Raskin:
Minimum-Time Reachability in Timed Games.
ICALP 2007: 825-837 |
11 | EE | Patricia Bouyer,
Thomas Brihaye,
Fabrice Chevalier:
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS 2007: 69-83 |
10 | EE | Patricia Bouyer,
Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design 31(2): 135-175 (2007) |
2006 |
9 | EE | Patricia Bouyer,
Thomas Brihaye,
Fabrice Chevalier:
Control in o-minimal Hybrid Systems.
LICS 2006: 367-378 |
8 | EE | Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
On model-checking timed automata with stopwatch observers.
Inf. Comput. 204(3): 408-433 (2006) |
7 | EE | Patricia Bouyer,
Thomas Brihaye,
Nicolas Markey:
Improved undecidability results on weighted timed automata.
Inf. Process. Lett. 98(5): 188-194 (2006) |
6 | EE | Thomas Brihaye,
Christian Michaux:
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478].
J. Complexity 22(3): 431-434 (2006) |
5 | EE | Thomas Brihaye:
A note on the undecidability of the reachability problem for o-minimal dynamical systems.
Math. Log. Q. 52(2): 165-170 (2006) |
2005 |
4 | EE | Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
On Optimal Timed Strategies.
FORMATS 2005: 49-64 |
3 | EE | Thomas Brihaye,
Christian Michaux:
On the expressiveness and decidability of o-minimal hybrid systems.
J. Complexity 21(4): 447-478 (2005) |
2004 |
2 | EE | Thomas Brihaye,
Véronique Bruyère,
Jean-François Raskin:
Model-Checking for Weighted Timed Automata.
FORMATS/FTRTFT 2004: 277-292 |
1 | EE | Thomas Brihaye,
Christian Michaux,
Cédric Rivière,
Christophe Troestler:
On O-Minimal Hybrid Systems.
HSCC 2004: 219-233 |