Suivre
Veronique Bruyere
Veronique Bruyere
Adresse e-mail validée de umons.ac.be - Page d'accueil
Titre
Citée par
Citée par
Année
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
3481994
Acacia+, a tool for LTL synthesis
A Bohy, V Bruyère, E Filiot, N Jin, JF Raskin
Computer Aided Verification: 24th International Conference, CAV 2012 …, 2012
1752012
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
1052007
Bertrand numeration systems and recognizability
V Bruyère, G Hansel
Theoretical computer science 181 (1), 17-43, 1997
931997
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
872017
On optimal timed strategies
T Brihaye, V Bruyere, JF Raskin
Formal Modeling and Analysis of Timed Systems: Third International …, 2005
852005
Model-checking for weighted timed automata
T Brihaye, V Bruyere, JF Raskin
International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2004
782004
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
622013
On completion of codes with finite deciphering delay
V Bruyère, L Wang, L Zhang
European Journal of Combinatorics 11 (6), 513-521, 1990
561990
Automata on linear orderings
V Bruyere, O Carton
Journal of Computer and System Sciences 73 (1), 1-24, 2007
522007
Automata on linear orderings
V Bruyere, O Carton
Mathematical Foundations of Computer Science 2001: 26th International …, 2001
522001
Variable-length maximal codes
V Bruyere, M Latteux
International Colloquium on Automata, Languages, and Programming, 24-47, 1996
511996
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
452003
Real-time model-checking: Parameters everywhere
V Bruyere, JF Raskin
Logical Methods in Computer Science 3, 2007
412007
Computer aided synthesis: A game-theoretic approach
V Bruyère
Developments in Language Theory: 21st International Conference, DLT 2017 …, 2017
382017
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
362014
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
312020
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
292013
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
282010
Equilibria in quantitative reachability games
T Brihaye, V Bruyere, J De Pril
Computer Science–Theory and Applications: 5th International Computer Science …, 2010
272010
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20