( en | de | ru )

 

Disambiguation of "Bruyère, Véronique"

Author of the publication

copydeleteadd this publication to your clipboard
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.

, , , and . Inf. Comput., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marc Bruyère

Véronique Trappe

Véronique Porra

Véronique Buschmann

Véronique Mersseman

 

Other publications of authors with the same name

Durations and parametric model-checking in timed automata., , and . ACM Trans. Comput. Log., 9 (2): 12:1-12:23 (2008)Recognizable Sets of Numbers in Nonstandard Bases., and . LATIN, volume 911 of Lecture Notes in Computer Science, page 167-179. Springer, (1995)The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games (full version)., , , , and . CoRR, (2019)Antichain-Based QBF Solving., , , , and . ATVA, volume 6996 of Lecture Notes in Computer Science, page 183-197. Springer, (2011)Turán Graphs, Stability Number, and Fibonacci Index., and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 127-138. Springer, (2008)Active Learning of Mealy Machines with Timers., , , , and . CoRR, (2024)Automata with Timers., , , and . FORMATS, volume 14138 of Lecture Notes in Computer Science, page 33-49. Springer, (2023)Pareto-Rational Verification., , and . CONCUR, volume 243 of LIPIcs, page 33:1-33:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Relevant Equilibria in Reachability Games., , , and . RP, volume 11674 of Lecture Notes in Computer Science, page 48-62. Springer, (2019)Automata on Linear Orderings., and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 236-247. Springer, (2001)