Sciweavers

STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 11 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar