Faster Algorithms for Finitary Games

Florian Horn (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

The theory of games is a prominent tool in the controller synthesis problem. The class of omega-regular games, in particular, offers a clear and robust model of specifications, and presents an alternative vision of several logic-related problems. Each omega-regular condition can be expressed by a combination of safety and liveness conditions. An issue with the classical definition of liveness specifications is that there is no control over the time spent between two successive occurrences of the desired events. Finitary logics were defined to handle this problem, and recently, Chatterjee and Henzinger introduced games based on a finitary notion of liveness. They defined and studied finitary parity and Streett winning conditions. We present here faster algorithms for these games, as well as an improved upper bound on the memory needed by Eve in the Streett case.

Domaines: Informatique

Florian Horn. Faster Algorithms for Finitary Games. Tools and Algorithms for the Construction and Analysis of Systems 13th International Conference, TACAS 2007, Apr 2007, Braga, Portugal. pp.472-484, ⟨10.1007/978-3-540-71209-1_36⟩. ⟨hal-00164192⟩