| Infinite runs in weighted timed automata with energy constraints P Bouyer, U Fahrenberg, KG Larsen, N Markey, J Srba Formal Modeling and Analysis of Timed Systems: 6th International Conference …, 2008 | 253 | 2008 |
| Forward analysis of updatable timed automata P Bouyer Formal Methods in System Design 24, 281-320, 2004 | 147 | 2004 |
| Updatable timed automata P Bouyer, C Dufourd, E Fleury, A Petit Theoretical Computer Science 321 (2-3), 291-345, 2004 | 145 | 2004 |
| Fault diagnosis using timed automata P Bouyer, F Chevalier, D D’Souza International Conference on Foundations of Software Science and Computation …, 2005 | 141 | 2005 |
| Optimal strategies in priced timed game automata P Bouyer, F Cassez, E Fleury, KG Larsen International Conference on Foundations of Software Technology and …, 2004 | 141 | 2004 |
| 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, 204-215, 2006 | 130 | 2006 |
| Untameable Timed Automata! Extended Abstract P Bouyer Annual Symposium on Theoretical Aspects of Computer Science, 620-631, 2003 | 119 | 2003 |
| Are timed automata updatable? P Bouyer, C Dufourd, E Fleury, A Petit Computer Aided Verification: 12th International Conference, CAV 2000 …, 2000 | 118 | 2000 |
| 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 | 117 | 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 | 107 | 2003 |
| On the optimal reachability problem of weighted timed automata P Bouyer, T Brihaye, V Bruyere, JF Raskin Formal Methods in System Design 31 (2), 135-175, 2007 | 105 | 2007 |
| Timed control with partial observability P Bouyer, D D’Souza, P Madhusudan, A Petit Computer Aided Verification: 15th International Conference, CAV 2003 …, 2003 | 101 | 2003 |
| On the expressiveness of TPTL and MTL P Bouyer, F Chevalier, N Markey International Conference on Foundations of Software Technology and …, 2005 | 100 | 2005 |
| Optimal infinite scheduling for multi-priced timed automata P Bouyer, E Brinksma, KG Larsen Formal Methods in System Design 32, 3-23, 2008 | 99 | 2008 |
| Improved undecidability results on weighted timed automata P Bouyer, T Brihaye, N Markey Information Processing Letters 98 (5), 188-194, 2006 | 97 | 2006 |
| An algebraic approach to data languages and timed languages P Bouyer, A Petit, D Thérien Information and Computation 182 (2), 137-162, 2003 | 96 | 2003 |
| Quantitative analysis of real-time systems using priced timed automata P Bouyer, U Fahrenberg, KG Larsen, N Markey Communications of the ACM 54 (9), 78-87, 2011 | 82 | 2011 |
| Model-checking timed temporal logics P Bouyer Electronic notes in theoretical computer science 231, 323-341, 2009 | 82 | 2009 |
| Staying alive as cheaply as possible P Bouyer, E Brinksma, KG Larsen International Workshop on Hybrid Systems: Computation and Control, 203-218, 2004 | 82 | 2004 |
| When are timed automata determinizable? C Baier, N Bertrand, P Bouyer, T Brihaye Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009 | 78 | 2009 |
Nicolas MarkeyCNRS, IRISA, Univ. Rennes, France在 irisa.fr 的电子邮件经过验证
