Véronique Bruyère

According to our database, Véronique Bruyère authored at least 99 papers between 1988 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021.

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

Int. J. Softw. Tools Technol. Transf., October, 2024

Stackelberg-Pareto Synthesis.

Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines

ACM Trans. Comput. Log., April, 2024

Active Learning of Mealy Machines with Timers.

Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager

CoRR, 2024

As Soon as Possible but Rationally.

Véronique Bruyère, Christophe Grandmont, Jean-François Raskin

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

Validating Streaming JSON Documents with Learned VPAs.

Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete.

Thomas Brihaye, Véronique Bruyère, Gaspard Reghem

Proceedings of the Reachability Problems - 17th International Conference, 2023

Automata with Timers.

Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet, Frits W. Vaandrager

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2023

2022

Stackelberg-Pareto Synthesis (Extended Version).

Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines

CoRR, 2022

Learning Realtime One-Counter Automata.

Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Pareto-Rational Verification.

Véronique Bruyère, Jean-François Raskin, Clément Tamines

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

A Game-Theoretic Approach for the Synthesis of Complex Systems.

Véronique Bruyère

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Synthesis of equilibria in infinite-duration games on graphs.

Véronique Bruyère

ACM SIGLOG News, 2021

On relevant equilibria in reachability games.

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Nathan Thomasset

J. Comput. Syst. Sci., 2021

On the existence of weak subgame perfect equilibria.

Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin

Inf. Comput., 2021

Constrained existence problem for weak subgame perfect equilibria with <i>ω</i>-regular Boolean objectives.

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin

Inf. Comput., 2021

Stackelberg-Pareto Synthesis (Full Version).

Véronique Bruyère, Jean-François Raskin, Clément Tamines

CoRR, 2021

Stackelberg-Pareto Synthesis.

Véronique Bruyère, Jean-François Raskin, Clément Tamines

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games.

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard

Log. Methods Comput. Sci., 2020

2019

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version).

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard

CoRR, 2019

Partial Solvers for Generalized Parity Games.

Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin, Clément Tamines

Proceedings of the Reachability Problems - 13th International Conference, 2019

Energy Mean-Payoff Games.

Véronique Bruyère, Quentin Hautem, Mickael Randour, Jean-François Raskin

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives.

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives.

Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin

CoRR, 2018

Parameterized complexity of games with monotonically ordered omega-regular objectives.

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.

Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin

Inf. Comput., 2017

Games with lexicographically ordered $ω$-regular objectives.

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

CoRR, 2017

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.

Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand

Acta Informatica, 2017

Computer Aided Synthesis: A Game-Theoretic Approach.

Véronique Bruyère

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version).

Véronique Bruyère, Quentin Hautem, Mickael Randour

CoRR, 2016

Window parity games: an alternative approach toward parity games with time bounds.

Véronique Bruyère, Quentin Hautem, Mickael Randour

Proceedings of the Seventh International Symposium on Games, 2016

On the Complexity of Heterogeneous Multidimensional Games.

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

On the complexity of heterogeneous multidimensional quantitative games.

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

CoRR, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.

Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

On Equilibria in Quantitative Games with Reachability/Safety Objectives.

Thomas Brihaye, Véronique Bruyère, Julie De Pril

Theory Comput. Syst., 2014

Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword.

Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo

RAIRO Theor. Informatics Appl., 2014

Expectations or Guarantees? I Want It All! A crossroad between games and MDPs.

Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes.

Aaron Bohy, Véronique Bruyère, Jean-François Raskin

Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.

Aaron Bohy, Véronique Bruyère, Jean-François Raskin

CoRR, 2014

Reasoning on BGP routing filters using tree automata.

Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin

Comput. Networks, 2014

Secure equilibria in weighted games.

Véronique Bruyère, Noémie Meunier, Jean-François Raskin

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Synthesis from LTL Specifications with Mean-Payoff Objectives.

Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Right-Universality of Visibly Pushdown Automata.

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

Proceedings of the Runtime Verification - 4th International Conference, 2013

Visibly Pushdown Automata: Universality and Inclusion via Antichains.

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

Proceedings of the Language and Automata Theory and Applications, 2013

2012

An aperiodicity problem for multiwords.

Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen

RAIRO Theor. Informatics Appl., 2012

Trees with Given Stability Number and Minimum Number of Stable Sets.

Véronique Bruyère, Gwenaël Joret, Hadrien Mélot

Graphs Comb., 2012

On Subgame Perfection in Quantitative Reachability Games

Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert

Log. Methods Comput. Sci., 2012

Visibly pushdown automata on trees: universality and u-universality

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

CoRR, 2012

Subgame Perfection for Equilibria in Quantitative Reachability Games.

Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Acacia+, a Tool for LTL Synthesis.

Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin, Jean-François Raskin

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

Antichain-Based QBF Solving.

Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin

Proceedings of the Automated Technology for Verification and Analysis, 2011

2010

Foreword.

Véronique Bruyère, Michel Rigo

RAIRO Theor. Informatics Appl., 2010

Formal language properties of hybrid systems with strong resets.

Thomas Brihaye, Véronique Bruyère, Elaine Render

RAIRO Theor. Informatics Appl., 2010

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

Bernard Boigelot, Julien Brusten, Véronique Bruyère

Log. Methods Comput. Sci., 2010

Equilibria in Quantitative Reachability Games.

Thomas Brihaye, Véronique Bruyère, Julie De Pril

Proceedings of the Computer Science, 2010

2009

On the size of Boyer-Moore automata.

Ricardo Baeza-Yates, Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing

Theor. Comput. Sci., 2009

Fibonacci index and stability number of graphs: a polyhedral study.

Véronique Bruyère, Hadrien Mélot

J. Comb. Optim., 2009

Tree Automata and Automata on Linear Orderings.

Véronique Bruyère, Olivier Carton, Géraud Sénizergues

RAIRO Theor. Informatics Appl., 2009

On First-Order Query Rewriting for Incomplete Database Histories.

Véronique Bruyère, Alexandre Decan, Jef Wijsen

Proceedings of the TIME 2009, 2009

2008

Durations and parametric model-checking in timed automata.

Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin

ACM Trans. Comput. Log., 2008

Turán Graphs, Stability Number, and Fibonacci Index.

Véronique Bruyère, Hadrien Mélot

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Real-Time Model-Checking: Parameters everywhere.

Véronique Bruyère, Jean-François Raskin

Log. Methods Comput. Sci., 2007

Automata on linear orderings.

Véronique Bruyère, Olivier Carton

J. Comput. Syst. Sci., 2007

On the optimal reachability problem of weighted timed automata.

Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin

Formal Methods Syst. Des., 2007

Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique".

Michel Rigo, Véronique Bruyère

Discret. Math. Theor. Comput. Sci., 2007

2006

On model-checking timed automata with stopwatch observers.

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin

Inf. Comput., 2006

2005

Words derivated from Sturmian words.

Isabel M. Araújo, Véronique Bruyère

Theor. Comput. Sci., 2005

Sturmian words and a criterium by Michaux-Villemaire.

Isabel M. Araújo, Véronique Bruyère

Theor. Comput. Sci., 2005

Hierarchy Among Automata on Linear Orderings.

Véronique Bruyère, Olivier Carton

Theory Comput. Syst., 2005

On Optimal Timed Strategies.

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Sturmian Words: Dynamical Systems and Derivated Words.

Isabel M. Araújo, Véronique Bruyère

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

Model-Checking for Weighted Timed Automata.

Thomas Brihaye, Véronique Bruyère, Jean-François Raskin

Proceedings of the Formal Techniques, 2004

2003

Cumulative defect.

Véronique Bruyère

Theor. Comput. Sci., 2003

Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.

Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

1999

A Proof of Choffrut's Theorem on Subsequential Functions.

Véronique Bruyère, Christophe Reutenauer

Theor. Comput. Sci., 1999

Maximal Bifix Codes.

Véronique Bruyère, Dominique Perrin

Theor. Comput. Sci., 1999

On the Existence of Codings Between Trace Monoids.

Véronique Bruyère, Clelia de Felice

J. Autom. Lang. Comb., 1999

Editorial.

Véronique Bruyère

J. Autom. Lang. Comb., 1999

1998

The Meet Operation in the Lattice of Codes.

Véronique Bruyère, Denis Derencourt, Michel Latteux

Theor. Comput. Sci., 1998

On Maximal Codes with Bounded Synchronization Delay.

Véronique Bruyère

Theor. Comput. Sci., 1998

1997

Bertrand Numeration Systems and Recognizability.

Véronique Bruyère, Georges Hansel

Theor. Comput. Sci., 1997

On the Cobham-Semenov Theorem.

Françoise Point, Véronique Bruyère

Theory Comput. Syst., 1997

A Completion Algorithm for Codes with Bounded Synchronization Delay.

Véronique Bruyère

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Any Lifting of a Trace Coding is a Word Coding.

Véronique Bruyère, Clelia de Felice

Inf. Comput., 1996

Variable-Length Maximal Codes.

Véronique Bruyère, Michel Latteux

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

On Some Decision Problems for Trace Codings.

Véronique Bruyère, Clelia de Felice, Giovanna Guaiana

Theor. Comput. Sci., 1995

Synchronization and decomposability for a family of codes: Part 2.

Véronique Bruyère, Clelia de Felice

Discret. Math., 1995

Coding and Strong Coding in Trace Monoids.

Véronique Bruyère, Clelia de Felice

Proceedings of the STACS 95, 1995

Recognizable Sets of Numbers in Nonstandard Bases.

Véronique Bruyère, Georges Hansel

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

Coding with Traces.

Véronique Bruyère, Clelia de Felice, Giovanna Guaiana

Proceedings of the STACS 94, 1994

1992

Synchronization and Decomposability for a Family of Codes.

Véronique Bruyère, Clelia de Felice

Int. J. Algebra Comput., 1992

Automata and Codes with Bounded Deciphering Delay.

Véronique Bruyère

Proceedings of the LATIN '92, 1992

1991

Maximal Codes With Bounded Deciphering Delay.

Véronique Bruyère

Theor. Comput. Sci., 1991

Degree and Decomposability of Variable-Length Codes.

Véronique Bruyère, Clelia de Felice

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

On Completion of Codes with Finite Deciphering Delay.

Véronique Bruyère, Limin Wang, Liang Zhang

Eur. J. Comb., 1990

1989

About prefix sets of words.

Véronique Bruyère

J. Comb. Theory A, 1989

Factorisation Des Ensembles Préfixiels.

Véronique Bruyère

RAIRO Theor. Informatics Appl., 1989

Completion of Finite Codes with Finite Deciphering Delay.

Véronique Bruyère

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

An Answer to a Question about Finite Maximal Prefix Sets of Words.

Véronique Bruyère

Theor. Comput. Sci., 1988

On Maximal Prefix Sets of Words.

Véronique Bruyère

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988