Algorithms for omega-regular games with imperfect information

K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, Logical Methods in Computer Science 3 (2007) 1–23.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Author
; ; ;
Abstract
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective. The fixed point is computed in the lattice of antichains of state sets. This algorithm has the advantages of being directed by the objective and of avoiding an explicit subset construction on the game graph. Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective. This set is of interest because in the absence of perfect information, randomized strategies are more powerful than deterministic ones. We show that our algorithms are optimal by proving matching lower bounds.
Publishing Year
Date Published
2007-07-27
Journal Title
Logical Methods in Computer Science
Acknowledgement
This research was supported in part by the NSF grants CCR-0225610 and CCR-0234690 by the SNSF under the Indo-Swiss Joint Research Programme and by the FRFC project “Centre Fédéré en Vérification” funded by the FNRS under grant 2.4530.02.
Volume
3
Issue
184
Page
1 - 23
IST-REx-ID

Cite this

Chatterjee K, Doyen L, Henzinger TA, Raskin J. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 2007;3(184):1-23. doi:10.2168/LMCS-3(3:4)2007
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2007). Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science, 3(184), 1–23. https://doi.org/10.2168/LMCS-3(3:4)2007
Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information.” Logical Methods in Computer Science 3, no. 184 (2007): 1–23. https://doi.org/10.2168/LMCS-3(3:4)2007.
K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” Logical Methods in Computer Science, vol. 3, no. 184, pp. 1–23, 2007.
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2007. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science. 3(184), 1–23.
Chatterjee, Krishnendu, et al. “Algorithms for Omega-Regular Games with Imperfect Information.” Logical Methods in Computer Science, vol. 3, no. 184, International Federation of Computational Logic, 2007, pp. 1–23, doi:10.2168/LMCS-3(3:4)2007.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar