K. Chatterjee, L. de Alfaro, and T. A. Henzinger. The complexity of stochastic Rabin and Streett games. In Proc. 32nd Int. Coll. Automata, Languages, and Programming (ICALP 2005), Lisbon, Portugal, July 2005, volume 3580 of Lecture Notes in Computer Science, pages 878--890. Springer, 2005. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Two-player Nonzero-sum ω-regular Games - Chatterjee (2004) Self-citation (Chatterjee) (Correct)
No context found.
K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of stochastic rabin and streett games. 2004.
Algorithms for Stochastic Parity Games - Chatterjee, Henzinger (2005) Self-citation (Chatterjee Henzinger) (Correct)
No context found.
K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of stochastic rabin and streett games. Technical Report UCB/CSD-31355, UC Berkeley, 2004. To appear ICALP 05.
On Computing Fixpoints in Well-Structured Regular Model.. - Baier Bertrand And (Correct)
No context found.
K. Chatterjee, L. de Alfaro, and T. A. Henzinger. The complexity of stochastic Rabin and Streett games. In Proc. 32nd Int. Coll. Automata, Languages, and Programming (ICALP 2005), Lisbon, Portugal, July 2005, volume 3580 of Lecture Notes in Computer Science, pages 878--890. Springer, 2005.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC