2 results
Nathanaël Fijalkow ; Martin Zimmermann.
We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions […]
Published on June 26, 2014
Thomas Colcombet ; Nathanaël Fijalkow ; Florian Horn.
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size of the maximal antichain of left quotients […]
Published on January 29, 2024