52 citations · 269 across the 38 of their papers we have counts for
4 papers · 1 filter
How to Play Optimally for Regular Objectives?
Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour +1
This paper studies two-player zero-sum games played on graphs and makes contributions toward the following question: given an objective, how much memory is required to play optimal…
Zone-based verification of timed automata: extrapolations, simulations and what next?
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau +2
Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the verification of real…
Half-Positional Objectives Recognized by Deterministic Büchi Automata
Patricia Bouyer, Antonio Casares, Mickael Randour +1
In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we char…
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games
Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
We study two-player concurrent stochastic games on finite graphs, with Büchi and co-Büchi objectives. The goal of the first player is to maximize the probability of satisfying the…