The Community for Technology Leaders
Logic in Computer Science, Symposium on (2005)
Chicago, Illinois
June 26, 2005 to June 29, 2005
ISSN: 1043-6871
ISBN: 0-7695-2266-1
pp: 178-187
Krishnendu Chatterjee , University of California, Berkeley
Thomas A. Henzinger , University of California, Berkeley
Marcin Jurdzinski , University of Warwick
Games played on graphs may have qualitative objectives, such as the satisfaction of an ?-regular property, or quantitative objectives, such as the optimization of a realvalued reward. When games are used to model reactive systems with both fairness assumptions and quantitative (e.g., resource) constraints, then the corresponding objective combines both a qualitative and a quantitative component. In a general case of interest, the qualitative component is a parity condition and the quantitative component is a mean-payoff reward. We study and solve such mean-payoff parity games. We also prove some interesting facts about mean-payoff parity games which distinguish them both from mean-payoff and from parity games. In particular, we show that optimal strategies exist in mean-payoff parity games, but they may require infinite memory.
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski, "Mean-Payoff Parity Games", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 178-187, 2005, doi:10.1109/LICS.2005.26
84 ms
(Ver 3.3 (11022016))