| Logic and p-recognizable sets of integers. V Bruyère, G Hansel, C Michaux, R Villemaire Bulletin of the Belgian Mathematical Society Simon Stevin 1 (2), 191-238, 1994 | 372 | 1994 |
| Acacia+, a tool for LTL synthesis A Bohy, V Bruyère, E Filiot, N Jin, JF Raskin International Conference on Computer Aided Verification, 652-657, 2012 | 192 | 2012 |
| 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 | 111 | 2007 |
| Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games V Bruyère, E Filiot, M Randour, JF Raskin Information and Computation 254, 259-295, 2017 | 97 | 2017 |
| Bertrand numeration systems and recognizability V Bruyère, G Hansel Theoretical computer science 181 (1), 17-43, 1997 | 97 | 1997 |
| On optimal timed strategies T Brihaye, V Bruyere, JF Raskin International Conference on Formal Modeling and Analysis of Timed Systems, 49-64, 2005 | 93 | 2005 |
| Model-checking for weighted timed automata T Brihaye, V Bruyere, JF Raskin International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2004 | 79 | 2004 |
| Synthesis from LTL specifications with mean-payoff objectives A Bohy, V Bruyere, E Filiot, JF Raskin International Conference on Tools and Algorithms for the Construction and …, 2013 | 67 | 2013 |
| Automata on linear orderings V Bruyere, O Carton Journal of Computer and System Sciences 73 (1), 1-24, 2007 | 64 | 2007 |
| On completion of codes with finite deciphering delay V Bruyère, L Wang, L Zhang European Journal of Combinatorics 11 (6), 513-521, 1990 | 58 | 1990 |
| Variable-length maximal codes V Bruyere, M Latteux International Colloquium on Automata, Languages, and Programming, 24-47, 1996 | 51 | 1996 |
| Durations, parametric model-checking in timed automata with presburger arithmetic V Bruyere, E Dall’Olio, JF Raskin Annual Symposium on Theoretical Aspects of Computer Science, 687-698, 2003 | 45 | 2003 |
| Automata on linear orderings V Bruyere, O Carton International Symposium on Mathematical Foundations of Computer Science, 236-247, 2001 | 45 | 2001 |
| Computer aided synthesis: A game-theoretic approach V Bruyère International Conference on Developments in Language Theory, 3-35, 2017 | 44 | 2017 |
| Real-time model-checking: Parameters everywhere V Bruyere, JF Raskin Logical Methods in Computer Science 3, 2007 | 44 | 2007 |
| The reactive synthesis competition (SYNTCOMP): 2018–2021 S Jacobs, GA Pérez, R Abraham, V Bruyere, M Cadilhac, M Colange, ... International journal on software tools for technology transfer 26 (5), 551-567, 2024 | 39 | 2024 |
| The complexity of subgame perfect equilibria in quantitative reachability games T Brihaye, V Bruyère, A Goeminne, JF Raskin, M Van den Bogaard Logical Methods in Computer Science 16, 2020 | 38 | 2020 |
| Secure equilibria in weighted games V Bruyère, N Meunier, JF Raskin Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 38 | 2014 |
| On the sets of real numbers recognized by finite automata in multiple bases B Boigelot, J Brusten, V Bruyere Logical Methods in Computer Science 6, 2010 | 30 | 2010 |
| On (subgame perfect) secure equilibrium in quantitative reachability games T Brihaye, V Bruyère, J De Pril, H Gimbert Logical Methods in Computer Science 9, 2013 | 28 | 2013 |
