| Infinite runs in weighted timed automata with energy constraints P Bouyer, U Fahrenberg, KG Larsen, N Markey, J Srba International Conference on Formal Modeling and Analysis of Timed Systems, 33-47, 2008 | 197 | 2008 |
| Forward analysis of updatable timed automata P Bouyer Formal Methods in System Design 24 (3), 281-320, 2004 | 138 | 2004 |
| Updatable timed automata P Bouyer, C Dufourd, E Fleury, A Petit Theoretical Computer Science 321 (2-3), 291-345, 2004 | 126 | 2004 |
| Optimal strategies in priced timed game automata P Bouyer, F Cassez, E Fleury, KG Larsen International Conference on Foundations of Software Technology and …, 2004 | 123 | 2004 |
| Are timed automata updatable? P Bouyer, C Dufourd, E Fleury, A Petit International Conference on Computer Aided Verification, 464-479, 2000 | 113 | 2000 |
| Fault diagnosis using timed automata P Bouyer, F Chevalier, D D’Souza International Conference on Foundations of Software Science and Computation …, 2005 | 110 | 2005 |
| Untameable timed automata! P Bouyer Annual Symposium on Theoretical Aspects of Computer Science, 620-631, 2003 | 101 | 2003 |
| Lower and upper bounds in zone-based abstractions of timed automata G Behrmann, P Bouyer, KG Larsen, R Pelánek International Journal on Software Tools for Technology Transfer 8 (3), 204-215, 2006 | 99 | 2006 |
| Timed control with partial observability P Bouyer, D D’Souza, P Madhusudan, A Petit International Conference on Computer Aided Verification, 180-192, 2003 | 99 | 2003 |
| The power of reachability testing for timed automata L Aceto, P Bouyer, A Burgueno, KG Larsen Theoretical Computer Science 300 (1-3), 411-475, 2003 | 99 | 2003 |
| Static guard analysis in timed automata verification G Behrmann, P Bouyer, E Fleury, KG Larsen International Conference on Tools and Algorithms for the Construction and …, 2003 | 94 | 2003 |
| Optimal infinite scheduling for multi-priced timed automata P Bouyer, E Brinksma, KG Larsen Formal Methods in System Design 32 (1), 3-23, 2008 | 90 | 2008 |
| On the optimal reachability problem of weighted timed automata P Bouyer, T Brihaye, V Bruyère, JF Raskin Formal Methods in System Design 31 (2), 135-175, 2007 | 90 | 2007 |
| An algebraic approach to data languages and timed languages P Bouyer, A Petit, D Thérien Information and Computation 182 (2), 137-162, 2003 | 87 | 2003 |
| Improved undecidability results on weighted timed automata P Bouyer, T Brihaye, N Markey Information Processing Letters 98 (5), 188-194, 2006 | 86 | 2006 |
| On the Expressiveness of TPTL and MTL P Bouyer, F Chevalier, N Markey International Conference on Foundations of Software Technology and …, 2005 | 84 | 2005 |
| Staying alive as cheaply as possible P Bouyer, E Brinksma, KG Larsen International Workshop on Hybrid Systems: Computation and Control, 203-218, 2004 | 75 | 2004 |
| A logical characterization of data languages P Bouyer Information Processing Letters 84 (2), 75-85, 2002 | 69 | 2002 |
| Robust model-checking of linear-time properties in timed automata P Bouyer, N Markey, PA Reynier Latin American Symposium on Theoretical Informatics, 238-249, 2006 | 64 | 2006 |
| Lower and upper bounds in zone based abstractions of timed automata G Behrmann, P Bouyer, KG Larsen, R Pelánek International Conference on Tools and Algorithms for the Construction and …, 2004 | 64 | 2004 |
Nicolas MarkeyCNRS, IRISA, Univ. Rennes, FranceAdresse e-mail validée de irisa.fr
