Véronique Bruyère

135 papers A* 5A 5B 18C 7Misc 1Journal 82Unranked 17
YearRankTypeTitle / Venue / Authors
2026 J jnl
An Automata-Based Approach to Games with ω-Automatic Preferences.
CoRR
Véronique Bruyère, Emmanuel Filiot, Christophe Grandmont, Jean-François Raskin
2026 J jnl
Visibly Recursive Automata.
CoRR
Kévin Dubrulle, Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
2025 — conf
Active Learning of Mealy Machines with Timers.
QEST+FORMATS
Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager
2025 B conf
Games with ω-Automatic Preference Relations.
MFCS
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2025 J jnl
Games with ω-Automatic Preference Relations.
CoRR
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2025 B conf
The Non-Cooperative Rational Synthesis Problem for SPEs and ω-Regular Objectives.
CONCUR
Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard
2024 J jnl
Active Learning of Mealy Machines with Timers.
CoRR
Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager
2024 B conf
As Soon as Possible but Rationally.
CONCUR
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2024 J jnl
As Soon as Possible but Rationally.
CoRR
Véronique Bruyère, Christophe Grandmont, Jean-François Raskin
2024 J jnl
Stackelberg-Pareto Synthesis.
ACM Trans. Comput. Log.
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
2024 J jnl
The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives.
CoRR
Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, Marie van den Bogaard
2024 J jnl
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021.
Int. J. Softw. Tools Technol. Transf.
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
2023 — conf
Automata with Timers.
FORMATS
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager
2023 J jnl
Automata with Timers.
CoRR
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager
2023 — conf
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete.
RP
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
2023 J jnl
Quantitative Reachability Stackelberg-Pareto Synthesis is NEXPTIME-Complete.
CoRR
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
2023 — conf
Validating Streaming JSON Documents with Learned VPAs.
TACAS (1)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
2022 C conf
A Game-Theoretic Approach for the Synthesis of Complex Systems.
CiE
Véronique Bruyère
2022 — conf
Learning Realtime One-Counter Automata.
TACAS (1)
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
2022 B conf
Pareto-Rational Verification.
CONCUR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2022 J jnl
Pareto-Rational Verification.
CoRR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2022 J jnl
Stackelberg-Pareto Synthesis (Extended Version).
CoRR
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines
2022 J jnl
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021.
CoRR
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
2022 J jnl
Validating Streaming JSON Documents with Learned VPAs.
CoRR
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
2021 J jnl
Constrained existence problem for weak subgame perfect equilibria with
Inf. Comput.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2021 J jnl
Learning Realtime One-Counter Automata.
CoRR
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
2021 J jnl
On relevant equilibria in reachability games.
J. Comput. Syst. Sci.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
2021 J jnl
On the existence of weak subgame perfect equilibria.
Inf. Comput.
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2021 J jnl
Stackelberg-Pareto Synthesis (Full Version).
CoRR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2021 B conf
Stackelberg-Pareto Synthesis.
CONCUR
Véronique Bruyère, Jean-François Raskin, Clément Tamines
2021 J jnl
Synthesis of equilibria in infinite-duration games on graphs.
ACM SIGLOG News
Véronique Bruyère
2020 J jnl
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
Log. Methods Comput. Sci.
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2019 B conf
Energy Mean-Payoff Games.
CONCUR
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
2019 J jnl
Energy mean-payoff games.
CoRR
Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin
2019 — conf
On Relevant Equilibria in Reachability Games.
RP
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
2019 J jnl
On Relevant Equilibria in Reachability Games.
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset
2019 — conf
Partial Solvers for Generalized Parity Games.
RP
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
2019 J jnl
Partial Solvers for Generalized Parity Games.
CoRR
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines
2019 J jnl
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version).
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2019 B conf
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.
CONCUR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard
2018 — conf
Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives.
GandALF
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2018 J jnl
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives.
CoRR
Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin
2018 B conf
Parameterized complexity of games with monotonically ordered omega-regular objectives.
CONCUR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2017 C conf
Computer Aided Synthesis: A Game-Theoretic Approach.
DLT
Véronique Bruyère
2017 J jnl
Computer aided synthesis: a game theoretic approach.
CoRR
Véronique Bruyère
2017 J jnl
Games with lexicographically ordered $ω$-regular objectives.
CoRR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2017 J jnl
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.
Inf. Comput.
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2017 B conf
On the Existence of Weak Subgame Perfect Equilibria.
FoSSaCS
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2017 J jnl
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
Acta Informatica
Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand
2016 B conf
On the Complexity of Heterogeneous Multidimensional Games.
CONCUR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2016 J jnl
On the existence of weak subgame perfect equilibria.
CoRR
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
2016 J jnl
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version).
CoRR
Véronique Bruyère, Quentin Hautem, Mickael Randour
2016 — conf
Window parity games: an alternative approach toward parity games with time bounds.
GandALF
Véronique Bruyère, Quentin Hautem, Mickael Randour
2015 J jnl
On the complexity of heterogeneous multidimensional quantitative games.
CoRR
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
2015 B conf
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CSL
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2015 J jnl
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CoRR
Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2014 — conf
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs.
SR
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2014 A conf
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
STACS
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2014 J jnl
On Equilibria in Quantitative Games with Reachability/Safety Objectives.
Theory Comput. Syst.
Thomas Brihaye, Véronique Bruyère, Julie De Pril
2014 J jnl
Reasoning on BGP routing filters using tree automata.
Comput. Networks
Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin
2014 J jnl
Secure Equilibria in Weighted Games.
CoRR
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2014 — conf
Secure equilibria in weighted games.
CSL-LICS
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
2014 J jnl
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword.
RAIRO Theor. Informatics Appl.
Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo
2014 J jnl
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
CoRR
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
2014 — conf
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes.
SYNT
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
2013 J jnl
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
CoRR
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin
2013 B conf
Right-Universality of Visibly Pushdown Automata.
RV
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
2013 A conf
Synthesis from LTL Specifications with Mean-Payoff Objectives.
TACAS
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
2013 C conf
Visibly Pushdown Automata: Universality and Inclusion via Antichains.
LATA
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
2012 A* conf
Acacia+, a Tool for LTL Synthesis.
CAV
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2012 J jnl
An aperiodicity problem for multiwords.
RAIRO Theor. Informatics Appl.
Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen
2012 J jnl
On Equilibria in Quantitative Games with Reachability/Safety Objectives
CoRR
Thomas Brihaye, Véronique Bruyère, Julie De Pril
2012 J jnl
On Subgame Perfection in Quantitative Reachability Games
Log. Methods Comput. Sci.
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
2012 B conf
Subgame Perfection for Equilibria in Quantitative Reachability Games.
FoSSaCS
Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert
2012 J jnl
Synthesis from LTL Specifications with Mean-Payoff Objectives
CoRR
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
2012 J jnl
Trees with Given Stability Number and Minimum Number of Stable Sets.
Graphs Comb.
Véronique Bruyère, Gwenaël Joret, Hadrien Mélot
2012 J jnl
Visibly pushdown automata on trees: universality and u-universality
CoRR
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
2011 B conf
Antichain-Based QBF Solving.
ATVA
Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin
2010 Misc conf
Equilibria in Quantitative Reachability Games.
CSR
Thomas Brihaye, Véronique Bruyère, Julie De Pril
2010 J jnl
Foreword.
RAIRO Theor. Informatics Appl.
Véronique Bruyère, Michel Rigo
2010 J jnl
Formal language properties of hybrid systems with strong resets.
RAIRO Theor. Informatics Appl.
Thomas Brihaye, Véronique Bruyère, Elaine Render
2010 J jnl
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Log. Methods Comput. Sci.
Bernard Boigelot, Julien Brusten, Véronique Bruyère
2009 J jnl
Fibonacci index and stability number of graphs: a polyhedral study.
J. Comb. Optim.
Véronique Bruyère, Hadrien Mélot
2009 C conf
On First-Order Query Rewriting for Incomplete Database Histories.
TIME
Véronique Bruyère, Alexandre Decan, Jef Wijsen
2009 J jnl
On the size of Boyer-Moore automata.
Theor. Comput. Sci.
Ricardo Baeza-Yates, Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing
2009 J jnl
Tree Automata and Automata on Linear Orderings.
RAIRO Theor. Informatics Appl.
Véronique Bruyère, Olivier Carton, Géraud Sénizergues
2008 J jnl
Durations and parametric model-checking in timed automata.
ACM Trans. Comput. Log.
Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
2008 J jnl
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
CoRR
Véronique Bruyère, Hadrien Mélot
2008 — conf
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases.
ICALP (2)
Bernard Boigelot, Julien Brusten, Véronique Bruyère
2008 J jnl
Turán Graphs, Stability Number, and Fibonacci Index
CoRR
Véronique Bruyère, Hadrien Mélot
2008 C conf
Turán Graphs, Stability Number, and Fibonacci Index.
COCOA
Véronique Bruyère, Hadrien Mélot
2007 J jnl
Automata on linear orderings.
J. Comput. Syst. Sci.
Véronique Bruyère, Olivier Carton
2007 J jnl
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique".
Discret. Math. Theor. Comput. Sci.
Michel Rigo, Véronique Bruyère
2007 J jnl
On the optimal reachability problem of weighted timed automata.
Formal Methods Syst. Des.
Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2007 J jnl
Real-Time Model-Checking: Parameters everywhere
CoRR
Véronique Bruyère, Jean-François Raskin
2007 J jnl
Real-Time Model-Checking: Parameters everywhere.
Log. Methods Comput. Sci.
Véronique Bruyère, Jean-François Raskin
2006 J jnl
On model-checking timed automata with stopwatch observers.
Inf. Comput.
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2005 J jnl
Hierarchy Among Automata on Linear Orderings.
Theory Comput. Syst.
Véronique Bruyère, Olivier Carton
2005 — conf
On Optimal Timed Strategies.
FORMATS
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2005 C conf
Sturmian Words: Dynamical Systems and Derivated Words.
Developments in Language Theory
Isabel M. Araújo, Véronique Bruyère
2005 J jnl
Sturmian words and a criterium by Michaux-Villemaire.
Theor. Comput. Sci.
Isabel M. Araújo, Véronique Bruyère
2005 J jnl
Words derivated from Sturmian words.
Theor. Comput. Sci.
Isabel M. Araújo, Véronique Bruyère
2004 — conf
Model-Checking for Weighted Timed Automata.
FORMATS/FTRTFT
Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
2003 J jnl
Cumulative defect.
Theor. Comput. Sci.
Véronique Bruyère
2003 A conf
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
STACS
Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
2003 — conf
Real-Time Model-Checking: Parameters Everywhere.
FSTTCS
Véronique Bruyère, Jean-François Raskin
2002 C conf
Automata on Linear Orderings.
Developments in Language Theory
Véronique Bruyère, Olivier Carton
2002 — conf
Hierarchy Among Automata on Linear Orderings.
IFIP TCS
Véronique Bruyère, Olivier Carton
2001 B conf
Automata on Linear Orderings.
MFCS
Véronique Bruyère, Olivier Carton
1999 J jnl
A Proof of Choffrut's Theorem on Subsequential Functions.
Theor. Comput. Sci.
Véronique Bruyère, Christophe Reutenauer
1999 J jnl
Editorial.
J. Autom. Lang. Comb.
Véronique Bruyère
1999 J jnl
Maximal Bifix Codes.
Theor. Comput. Sci.
Véronique Bruyère, Dominique Perrin
1999 J jnl
On the Existence of Codings Between Trace Monoids.
J. Autom. Lang. Comb.
Véronique Bruyère, Clelia De Felice
1998 J jnl
On Maximal Codes with Bounded Synchronization Delay.
Theor. Comput. Sci.
Véronique Bruyère
1998 J jnl
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci.
Véronique Bruyère, Denis Derencourt, Michel Latteux
1997 A* conf
A Completion Algorithm for Codes with Bounded Synchronization Delay.
ICALP
Véronique Bruyère
1997 J jnl
Bertrand Numeration Systems and Recognizability.
Theor. Comput. Sci.
Véronique Bruyère, Georges Hansel
1997 J jnl
On the Cobham-Semenov Theorem.
Theory Comput. Syst.
Françoise Point, Véronique Bruyère
1996 J jnl
Any Lifting of a Trace Coding is a Word Coding.
Inf. Comput.
Véronique Bruyère, Clelia De Felice
1996 A* conf
Variable-Length Maximal Codes.
ICALP
Véronique Bruyère, Michel Latteux
1995 A conf
Coding and Strong Coding in Trace Monoids.
STACS
Véronique Bruyère, Clelia De Felice
1995 J jnl
On Some Decision Problems for Trace Codings.
Theor. Comput. Sci.
Véronique Bruyère, Clelia De Felice, Giovanna Guaiana
1995 B conf
Recognizable Sets of Numbers in Nonstandard Bases.
LATIN
Véronique Bruyère, Georges Hansel
1995 J jnl
Synchronization and decomposability for a family of codes: Part 2.
Discret. Math.
Véronique Bruyère, Clelia De Felice
1994 A conf
Coding with Traces.
STACS
Véronique Bruyère, Clelia De Felice, Giovanna Guaiana
1992 B conf
Automata and Codes with Bounded Deciphering Delay.
LATIN
Véronique Bruyère
1992 J jnl
Synchronization and Decomposability for a Family of Codes.
Int. J. Algebra Comput.
Véronique Bruyère, Clelia De Felice
1991 A* conf
Degree and Decomposability of Variable-Length Codes.
ICALP
Véronique Bruyère, Clelia De Felice
1991 J jnl
Maximal Codes With Bounded Deciphering Delay.
Theor. Comput. Sci.
Véronique Bruyère
1990 J jnl
On Completion of Codes with Finite Deciphering Delay.
Eur. J. Comb.
Véronique Bruyère, Limin Wang, Liang Zhang
1989 J jnl
About prefix sets of words.
J. Comb. Theory A
Véronique Bruyère
1989 A* conf
Completion of Finite Codes with Finite Deciphering Delay.
ICALP
Véronique Bruyère
1989 J jnl
Factorisation Des Ensembles Préfixiels.
RAIRO Theor. Informatics Appl.
Véronique Bruyère
1988 J jnl
An Answer to a Question about Finite Maximal Prefix Sets of Words.
Theor. Comput. Sci.
Véronique Bruyère
1988 B conf
On Maximal Prefix Sets of Words.
MFCS
Véronique Bruyère