Search the dblp DataBase

Publications of Author

1. Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
   Model-Checking for Weighted Timed Automata. [Citation Graph (0, 0)][DBLP]
   FORMATS/FTRTFT, 2004, pp:277-292 [Conf]
   
2. Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
   On Optimal Timed Strategies. [Citation Graph (0, 0)][DBLP]
   FORMATS, 2005, pp:49-64 [Conf]
   
3. Thomas Brihaye, Christian Michaux, Cédric Rivière, Christophe Troestler
   On O-Minimal Hybrid Systems. [Citation Graph (0, 0)][DBLP]
   HSCC, 2004, pp:219-233 [Conf]
   
4. Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
   Control in o-minimal Hybrid Systems. [Citation Graph (0, 0)][DBLP]
   LICS, 2006, pp:367-378 [Conf]
   
5. Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
   On model-checking timed automata with stopwatch observers. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2006, v:204, n:3, pp:408-433 [Journal]
   
6. Patricia Bouyer, Thomas Brihaye, Nicolas Markey
   Improved undecidability results on weighted timed automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:98, n:5, pp:188-194 [Journal]
   
7. Thomas Brihaye, Christian Michaux
   On the expressiveness and decidability of o-minimal hybrid systems. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 2005, v:21, n:4, pp:447-478 [Journal]
   
8. Thomas Brihaye, Christian Michaux
   Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]. [Citation Graph (0, 0)][DBLP]
   J. Complexity, 2006, v:22, n:3, pp:431-434 [Journal]
   
9. Thomas Brihaye
   A note on the undecidability of the reachability problem for o-minimal dynamical systems. [Citation Graph (0, 0)][DBLP]
   Math. Log. Q., 2006, v:52, n:2, pp:165-170 [Journal]
   
10. Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby
    Timed Concurrent Game Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:445-459 [Conf]
    
11. Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
    Minimum-Time Reachability in Timed Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:825-837 [Conf]
    
12. Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
    Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:69-83 [Conf]
    
13. Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
    On the optimal reachability problem of weighted timed automata. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2007, v:31, n:2, pp:135-175 [Journal]
    
14. 
    Equilibria in Quantitative Reachability Games. [Citation Graph (, )][DBLP]
    
    
15. 
    Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. [Citation Graph (, )][DBLP]
    
    
16. 
    Probabilistic and Topological Semantics for Timed Automata. [Citation Graph (, )][DBLP]
    
    
17. 
    When Are Timed Automata Determinizable? [Citation Graph (, )][DBLP]
    
    
18. 
    ATL with Strategy Contexts and Bounded Memory. [Citation Graph (, )][DBLP]
    
    
19. 
    Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. [Citation Graph (, )][DBLP]
    
    
20. 
    Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. [Citation Graph (, )][DBLP]
    
    
21. 
    Good Friends are Hard to Find! [Citation Graph (, )][DBLP]
    
    
22. 
    Cell decomposition and dimension function in the theory of closed ordered differential fields. [Citation Graph (, )][DBLP]
    
    
23. 
    Weighted o-minimal hybrid systems. [Citation Graph (, )][DBLP]
    
    
24. 
    O-Minimal Hybrid Reachability Games [Citation Graph (, )][DBLP]
    
    
25. 
    Words and Bisimulations of Dynamical Systems. [Citation Graph (, )][DBLP]