activity
20082023
most citedStochastic Timed Automata

52 citations · 269 across the 38 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.LO2020

Synthesizing safe coalition strategies

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar

Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent gam…

cs.LO2020

Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version)

Patricia Bouyer, Thomas Brihaye, Mickael Randour +2

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept…

cs.FL2020

Synthesis in Presence of Dynamic Links

Béatrice Bérard, Benedikt Bollig, Patricia Bouyer +2

The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behav…

cs.LO2020★ 1 cited

Decisiveness of Stochastic Systems and its Application to Hybrid Models

Patricia Bouyer, Thomas Brihaye, Mickael Randour +2

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept…

cs.GT2020★ 18 cited

Games Where You Can Play Optimally with Arena-Independent Finite Memory

Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj +2

For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller sy…