Véronique Bruyère

ORCID

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 44

Top Venues

CoRR

CONCUR

Inf. Comput.

Publications

Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete. CoRR (2023)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager
Automata with Timers. CoRR (2023)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager
Automata with Timers. FORMATS (2023)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
Validating Streaming JSON Documents with Learned VPAs. TACAS (1) (2023)
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. RP (2023)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
Learning Realtime One-Counter Automata. TACAS (1) (2022)
Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR (2022)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Pareto-Rational Verification. CoRR (2022)
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis (Extended Version). CoRR (2022)
Véronique Bruyère
A Game-Theoretic Approach for the Synthesis of Complex Systems. CiE (2022)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Pareto-Rational Verification. CONCUR (2022)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
Validating Streaming JSON Documents with Learned VPAs. CoRR (2022)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis. CONCUR (2021)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
Learning Realtime One-Counter Automata. CoRR (2021)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the existence of weak subgame perfect equilibria. Inf. Comput. 276 (2021)
Véronique Bruyère
Synthesis of equilibria in infinite-duration games on graphs. ACM SIGLOG News 8 (2) (2021)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
-regular Boolean objectives. Inf. Comput. 278 (2021)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
On relevant equilibria in reachability games. J. Comput. Syst. Sci. 119 (2021)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
Stackelberg-Pareto Synthesis (Full Version). CoRR (2021)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Log. Methods Comput. Sci. 16 (4) (2020)
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
Energy mean-payoff games. CoRR (2019)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
On Relevant Equilibria in Reachability Games. CoRR (2019)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
On Relevant Equilibria in Reachability Games. RP (2019)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version). CoRR (2019)
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
Energy Mean-Payoff Games. CONCUR (2019)
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
Partial Solvers for Generalized Parity Games. CoRR (2019)
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
Partial Solvers for Generalized Parity Games. RP (2019)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. CONCUR (2019)
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
Parameterized complexity of games with monotonically ordered omega-regular objectives. CONCUR (2018)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives. GandALF (2018)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. CoRR (2018)
Véronique Bruyère
Computer aided synthesis: a game theoretic approach. CoRR (2017)
Véronique Bruyère
Computer Aided Synthesis: A Game-Theoretic Approach. DLT (2017)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS (2017)
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
Games with lexicographically ordered $ω$-regular objectives. CoRR (2017)
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254 (2017)
Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica 54 (6) (2017)
Véronique Bruyère, Quentin Hautem, Mickael Randour
Window parity games: an alternative approach toward parity games with time bounds. GandALF (2016)
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
On the Complexity of Heterogeneous Multidimensional Games. CONCUR (2016)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the existence of weak subgame perfect equilibria. CoRR (2016)
Véronique Bruyère, Quentin Hautem, Mickael Randour
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version). CoRR (2016)
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CoRR (2015)
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
On the complexity of heterogeneous multidimensional quantitative games. CoRR (2015)
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. CSL (2015)
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
Secure equilibria in weighted games. CSL-LICS (2014)
Thomas Brihaye, Véronique Bruyère, Julie De Pril
On Equilibria in Quantitative Games with Reachability/Safety Objectives. Theory Comput. Syst. 54 (2) (2014)
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. CoRR (2014)
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. STACS (2014)
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes. SYNT (2014)
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
Secure Equilibria in Weighted Games. CoRR (2014)
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. SR (2014)
Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword. RAIRO Theor. Informatics Appl. 48 (3) (2014)
Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin
Reasoning on BGP routing filters using tree automata. Comput. Networks 65 (2014)
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
Right-Universality of Visibly Pushdown Automata. RV (2013)
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. CoRR (2013)
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
Visibly Pushdown Automata: Universality and Inclusion via Antichains. LATA (2013)
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
Synthesis from LTL Specifications with Mean-Payoff Objectives. TACAS (2013)
Véronique Bruyère, Gwenaël Joret, Hadrien Mélot
Trees with Given Stability Number and Minimum Number of Stable Sets. Graphs Comb. 28 (2) (2012)
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
On Subgame Perfection in Quantitative Reachability Games Log. Methods Comput. Sci. 9 (1) (2012)
Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen
An aperiodicity problem for multiwords. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
Synthesis from LTL Specifications with Mean-Payoff Objectives CoRR (2012)
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
Acacia+, a Tool for LTL Synthesis. CAV (2012)
Thomas Brihaye, Véronique Bruyère, Julie De Pril
On Equilibria in Quantitative Games with Reachability/Safety Objectives CoRR (2012)
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
Visibly pushdown automata on trees: universality and u-universality CoRR (2012)
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
Subgame Perfection for Equilibria in Quantitative Reachability Games. FoSSaCS (2012)
Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin
Antichain-Based QBF Solving. ATVA (2011)
Véronique Bruyère, Michel Rigo
Foreword. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Thomas Brihaye, Véronique Bruyère, Julie De Pril
Equilibria in Quantitative Reachability Games. CSR (2010)
Bernard Boigelot, Julien Brusten, Véronique Bruyère
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases Log. Methods Comput. Sci. 6 (1) (2010)
Thomas Brihaye, Véronique Bruyère, Elaine Render
Formal language properties of hybrid systems with strong resets. RAIRO Theor. Informatics Appl. 44 (1) (2010)
Ricardo Baeza-Yates, Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing
On the size of Boyer-Moore automata. Theor. Comput. Sci. 410 (43) (2009)
Véronique Bruyère, Hadrien Mélot
Fibonacci index and stability number of graphs: a polyhedral study. J. Comb. Optim. 18 (3) (2009)
Véronique Bruyère, Alexandre Decan, Jef Wijsen
On First-Order Query Rewriting for Incomplete Database Histories. TIME (2009)
Véronique Bruyère, Olivier Carton, Géraud Sénizergues
Tree Automata and Automata on Linear Orderings. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Véronique Bruyère, Hadrien Mélot
Turán Graphs, Stability Number, and Fibonacci Index. COCOA (2008)
Véronique Bruyère, Hadrien Mélot
Turán Graphs, Stability Number, and Fibonacci Index CoRR (2008)
Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
Durations and parametric model-checking in timed automata. ACM Trans. Comput. Log. 9 (2) (2008)
Véronique Bruyère, Hadrien Mélot
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study CoRR (2008)
Bernard Boigelot, Julien Brusten, Véronique Bruyère
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. ICALP (2) (2008)
Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
On the optimal reachability problem of weighted timed automata. Formal Methods Syst. Des. 31 (2) (2007)
Véronique Bruyère, Olivier Carton
Automata on linear orderings. J. Comput. Syst. Sci. 73 (1) (2007)
Véronique Bruyère, Jean-François Raskin
Real-Time Model-Checking: Parameters everywhere. Log. Methods Comput. Sci. 3 (1) (2007)
Michel Rigo, Véronique Bruyère
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique". Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Véronique Bruyère, Jean-François Raskin
Real-Time Model-Checking: Parameters everywhere CoRR (2007)
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
On model-checking timed automata with stopwatch observers. Inf. Comput. 204 (3) (2006)
Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. Theory Comput. Syst. 38 (5) (2005)
Isabel M. Araújo, Véronique Bruyère
Sturmian words and a criterium by Michaux-Villemaire. Theor. Comput. Sci. 339 (1) (2005)
Isabel M. Araújo, Véronique Bruyère
Words derivated from Sturmian words. Theor. Comput. Sci. 340 (1) (2005)
Isabel M. Araújo, Véronique Bruyère
Sturmian Words: Dynamical Systems and Derivated Words. Developments in Language Theory (2005)
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
On Optimal Timed Strategies. FORMATS (2005)
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
Model-Checking for Weighted Timed Automata. FORMATS/FTRTFT (2004)
Véronique Bruyère
Cumulative defect. Theor. Comput. Sci. 292 (1) (2003)
Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. STACS (2003)
Véronique Bruyère, Jean-François Raskin
Real-Time Model-Checking: Parameters Everywhere. FSTTCS (2003)
Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. IFIP TCS (2002)
Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. Developments in Language Theory (2002)
Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. MFCS (2001)
Véronique Bruyère, Dominique Perrin
Maximal Bifix Codes. Theor. Comput. Sci. 218 (1) (1999)
Véronique Bruyère
Editorial. J. Autom. Lang. Comb. 4 (3) (1999)
Véronique Bruyère, Clelia de Felice
On the Existence of Codings Between Trace Monoids. J. Autom. Lang. Comb. 4 (2) (1999)

Véronique Bruyère.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Véronique Bruyère