Véronique Bruyère

Véronique Bruyère is a Belgian computer scientist working in automata theory, temporal logic, and combinatorics on words, among other topics. She is a professor of computer science at the University of Mons in Belgium. Provided by Wikipedia
Showing 1 - 9 results of 9 for search 'Véronique Bruyère', query time: 0.04s Refine Results
  1. 1
    Foreword to the special issue dedicated to the 10 th Journées montoises d'informatique théorique

    Foreword to the special issue dedicated to the 10 th Journées montoises d'informatique théorique by Michel Rigo, Véronique Bruyère

    Published 2007-05-01
    Get full text
    Article
  2. 2
    Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''

    Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique'' by Véronique Bruyère, Michel Rigo

    Published 2007-01-01
    Get full text
    Article
  3. 3
    Real-Time Model-Checking: Parameters everywhere

    Real-Time Model-Checking: Parameters everywhere by Veronique Bruyere, Jean-Francois Raskin

    Published 2007-02-01
    Get full text
    Article
  4. 4
    On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

    On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases by Bernard Boigelot, Julien Brusten, Veronique Bruyere

    Published 2010-02-01
    Get full text
    Article
  5. 5
    Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds

    Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds by Véronique Bruyère, Quentin Hautem, Mickael Randour

    Published 2016-09-01
    Get full text
    Article
  6. 6
    Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes

    Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes by Aaron Bohy, Véronique Bruyère, Jean-François Raskin

    Published 2014-07-01
    Get full text
    Article
  7. 7
    Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives

    Constrained Existence Problem for Weak Subgame Perfect Equilibria with ω-Regular Boolean Objectives by Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin

    Published 2018-09-01
    Get full text
    Article
  8. 8
    On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

    On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games by Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert

    Published 2013-02-01
    Get full text
    Article
  9. 9
    The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games

    The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games by Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard

    Published 2020-11-01
    Get full text
    Article

Search Tools: