Véronique Bruyère

According to our database1, Véronique Bruyère
  • authored at least 91 papers between 1988 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.
Inf. Comput., 2017

Games with lexicographically ordered $ω$-regular objectives.
CoRR, 2017

Computer aided synthesis: a game theoretic approach.
CoRR, 2017

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
Acta Inf., 2017

On the Existence of Weak Subgame Perfect Equilibria.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Computer Aided Synthesis: A Game-Theoretic Approach.
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).
CoRR, 2016

Window parity games: an alternative approach toward parity games with time bounds.
Proceedings of the Seventh International Symposium on Games, 2016

On the existence of weak subgame perfect equilibria.
CoRR, 2016

On the Complexity of Heterogeneous Multidimensional Games.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
On the complexity of heterogeneous multidimensional quantitative games.
CoRR, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CoRR, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
On Equilibria in Quantitative Games with Reachability/Safety Objectives.
Theory Comput. Syst., 2014

Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword.
RAIRO - Theor. Inf. and Applic., 2014

Secure Equilibria in Weighted Games.
CoRR, 2014

Expectations or Guarantees? I Want It All! A crossroad between games and MDPs.
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes.
Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

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

Reasoning on BGP routing filters using tree automata.
Computer Networks, 2014

Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Secure equilibria in weighted games.
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
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
CoRR, 2013

Synthesis from LTL Specifications with Mean-Payoff Objectives.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Right-Universality of Visibly Pushdown Automata.
Proceedings of the Runtime Verification - 4th International Conference, 2013

Visibly Pushdown Automata: Universality and Inclusion via Antichains.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
An aperiodicity problem for multiwords.
RAIRO - Theor. Inf. and Applic., 2012

Trees with Given Stability Number and Minimum Number of Stable Sets.
Graphs and Combinatorics, 2012

Synthesis from LTL Specifications with Mean-Payoff Objectives
CoRR, 2012

On Subgame Perfection in Quantitative Reachability Games
Logical Methods in Computer Science, 2012

On Equilibria in Quantitative Games with Reachability/Safety Objectives
CoRR, 2012

Visibly pushdown automata on trees: universality and u-universality
CoRR, 2012

Subgame Perfection for Equilibria in Quantitative Reachability Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Acacia+, a Tool for LTL Synthesis.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Antichain-Based QBF Solving.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Foreword.
RAIRO - Theor. Inf. and Applic., 2010

Formal language properties of hybrid systems with strong resets.
RAIRO - Theor. Inf. and Applic., 2010

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Logical Methods in Computer Science, 2010

Equilibria in Quantitative Reachability Games.
Proceedings of the Computer Science, 2010

2009
On the size of Boyer-Moore automata.
Theor. Comput. Sci., 2009

Fibonacci index and stability number of graphs: a polyhedral study.
J. Comb. Optim., 2009

Tree Automata and Automata on Linear Orderings.
ITA, 2009

On First-Order Query Rewriting for Incomplete Database Histories.
Proceedings of the TIME 2009, 2009

2008
Durations and parametric model-checking in timed automata.
ACM Trans. Comput. Log., 2008

Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
CoRR, 2008

Turán Graphs, Stability Number, and Fibonacci Index
CoRR, 2008

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Turán Graphs, Stability Number, and Fibonacci Index.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Real-Time Model-Checking: Parameters everywhere.
Logical Methods in Computer Science, 2007

Automata on linear orderings.
J. Comput. Syst. Sci., 2007

On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design, 2007

Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique".
Discrete Mathematics & Theoretical Computer Science, 2007

Real-Time Model-Checking: Parameters everywhere
CoRR, 2007

2006
On model-checking timed automata with stopwatch observers.
Inf. Comput., 2006

2005
Words derivated from Sturmian words.
Theor. Comput. Sci., 2005

Sturmian words and a criterium by Michaux-Villemaire.
Theor. Comput. Sci., 2005

Hierarchy Among Automata on Linear Orderings.
Theory Comput. Syst., 2005

On Optimal Timed Strategies.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Sturmian Words: Dynamical Systems and Derivated Words.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Model-Checking for Weighted Timed Automata.
Proceedings of the Formal Techniques, 2004

2003
Cumulative defect.
Theor. Comput. Sci., 2003

Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Real-Time Model-Checking: Parameters Everywhere.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Hierarchy Among Automata on Linear Orderings.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Automata on Linear Orderings.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Automata on Linear Orderings.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

1999
A Proof of Choffrut's Theorem on Subsequential Functions.
Theor. Comput. Sci., 1999

Maximal Bifix Codes.
Theor. Comput. Sci., 1999

On the Existence of Codings Between Trace Monoids.
Journal of Automata, Languages and Combinatorics, 1999

1998
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci., 1998

On Maximal Codes with Bounded Synchronization Delay.
Theor. Comput. Sci., 1998

1997
Bertrand Numeration Systems and Recognizability.
Theor. Comput. Sci., 1997

On the Cobham-Semenov Theorem.
Theory Comput. Syst., 1997

A Completion Algorithm for Codes with Bounded Synchronization Delay.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Any Lifting of a Trace Coding is a Word Coding.
Inf. Comput., 1996

Variable-Length Maximal Codes.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
On Some Decision Problems for Trace Codings.
Theor. Comput. Sci., 1995

Synchronization and decomposability for a family of codes: Part 2.
Discrete Mathematics, 1995

Coding and Strong Coding in Trace Monoids.
STACS, 1995

Recognizable Sets of Numbers in Nonstandard Bases.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
Coding with Traces.
Proceedings of the STACS 94, 1994

1992
Synchronization and Decomposability for a Family of Codes.
IJAC, 1992

Automata and Codes with Bounded Deciphering Delay.
Proceedings of the LATIN '92, 1992

1991
Maximal Codes With Bounded Deciphering Delay.
Theor. Comput. Sci., 1991

Degree and Decomposability of Variable-Length Codes.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
On Completion of Codes with Finite Deciphering Delay.
Eur. J. Comb., 1990

1989
About prefix sets of words.
J. Comb. Theory, Ser. A, 1989

Factorisation Des Ensembles Préfixiels.
ITA, 1989

Completion of Finite Codes with Finite Deciphering Delay.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
An Answer to a Question about Finite Maximal Prefix Sets of Words.
Theor. Comput. Sci., 1988

On Maximal Prefix Sets of Words.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988


  Loading...