Veronique Bruyere
Veronique Bruyere
Verified email at umons.ac.be - Homepage
Title
Cited by
Cited by
Year
Logic and p-recognizable sets of integers.
V Bruyere, G Hansel, C Michaux, R Villemaire
Bulletin of the Belgian Mathematical Society Simon Stevin 1 (2), 191-238, 1994
2791994
Acacia+, a tool for LTL synthesis
A Bohy, V Bruyere, E Filiot, N Jin, JF Raskin
International Conference on Computer Aided Verification, 652-657, 2012
1302012
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
902007
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
872007
Model-checking for weighted timed automata
T Brihaye, V Bruyere, JF Raskin
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant …, 2004
772004
Bertrand numeration systems and recognizability
V Bruyere, G Hansel
Theoretical computer science 181 (1), 17-43, 1997
741997
On optimal timed strategies
T Brihaye, V Bruyere, JF Raskin
International Conference on Formal Modeling and Analysis of Timed Systems, 49-64, 2005
732005
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games
V Bruyere, E Filiot, M Randour, JF Raskin
Information and Computation 254, 259-295, 2017
722017
On completion of codes with finite deciphering delay
V Bruyère, L Wang, L Zhang
European Journal of Combinatorics 11 (6), 513-521, 1990
501990
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
492003
Automata on linear orderings
V Bruyere, O Carton
International Conference on Developments in Language Theory, 103-115, 2002
492002
Automata on linear orderings
V Bruyere, O Carton
International Conference on Developments in Language Theory, 103-115, 2002
492002
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
462013
Variable-length maximal codes
V Bruyere, M Latteux
International Colloquium on Automata, Languages, and Programming, 24-47, 1996
451996
Automata on linear orderings
V Bruyere, O Carton
Journal of Computer and System Sciences 73 (1), 1-24, 2007
442007
Real-time model-checking: Parameters everywhere
V Bruyere, JF Raskin
arXiv preprint cs/0701138, 2007
392007
On (subgame perfect) secure equilibrium in quantitative reachability games
T Brihaye, V Bruyère, J De Pril, H Gimbert
arXiv preprint arXiv:1205.6346, 2012
312012
Equilibria in quantitative reachability games
T Brihaye, V Bruyere, J De Pril
International Computer Science Symposium in Russia, 72-83, 2010
262010
Secure equilibria in weighted games
V Bruyere, N Meunier, JF Raskin
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
232014
On the sets of real numbers recognized by finite automata in multiple bases
B Boigelot, J Brusten, V Bruyère
International Colloquium on Automata, Languages, and Programming, 112-123, 2008
222008
The system can't perform the operation now. Try again later.
Articles 1–20