# Finitary Winning in \omega-Regular Games

### http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-120.pdf

Games on graphs with \omega-regular objectives provide a model for the control and synthesis of reactive systems. Every \omega-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens eventually.'' Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within $b$ transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (B\"uchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett (fairness) objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.

BibTeX citation:

@techreport{Chatterjee:EECS-2007-120,
Author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Horn, Florian},
Title = {Finitary Winning in \omega-Regular Games},
Institution = {EECS Department, University of California, Berkeley},
Year = {2007},
Month = {Oct},
URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-120.html},
Number = {UCB/EECS-2007-120},
Abstract = {Games on graphs with \omega-regular objectives provide a model for the control and synthesis of reactive systems.
Every \omega-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens eventually.'' Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity.
Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within $b$ transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (B\"uchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett (fairness) objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.}
}


EndNote citation:

%0 Report
%A Chatterjee, Krishnendu
%A Henzinger, Thomas A.
%A Horn, Florian
%T Finitary Winning in \omega-Regular Games
%I EECS Department, University of California, Berkeley
%D 2007
%8 October 8
%@ UCB/EECS-2007-120
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-120.html
%F Chatterjee:EECS-2007-120