L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proceedings of the 15th Annual Symposium on Logic in Computer Science, pages 141-154. IEEE Computer Society Press, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reachability Objectives - Krishnendu Chatterjee Luca Self-citation (De alfaro Henzinger) (Correct)
No context found.
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proc. 15th IEEE Symp. Logic in Comp. Sci., pages 141-154, 2000.
The Complexity of Quantitative Concurrent Parity Games - Chatterjee, Henzinger (2004) Self-citation (De alfaro Henzinger) (Correct)
No context found.
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proceedings of the 15th Annual Symposium on Logic in Computer Science, pages 141--154. IEEE Computer Society Press, 2000.
Quantitative Solution of Omega-Regular Games - de Alfaro, Majumdar (2001) (6 citations) Self-citation (De alfaro) (Correct)
....by replacing the predecessor operator Pre of classical calculus [Koz83b] by the controllable predecessor operator Cpre: for a set of states U , the set Cpre(U) consists of the states from which player 1 can force the game into U in one step. A richer version of game calculus was used in [dAH00] to provide qualitative solutions for concurrent probabilistic games with regular conditions. There, multi argument predecessor operators are used to compute the set of states from which player 1 can win with probability 1, or arbitrarily close to 1. We introduce quantitative game calculus, ....
.... can only guarantee the existence of optimal strategies for all 0 [Eve57] Third, whereas finite memory strategies suffice for winning deterministic turn based games, in concurrent games both optimal strategies, and optimal strategies if they exist, may need an infinite amount of memory [dAH00] Fourth, the standard recursive structure of proofs for deterministic turn based games [McN93, Tho95] breaks down, as both players can choose a distribution over moves at each state. We develop the arguments both for deterministic and for probabilistic concurrent games. Hence, as a special case ....
[Article contains additional citation context not shown here]
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proc. 15th IEEE Symp. Logic in Comp. Sci., pages 141--154, 2000.
Quantitative Solution of Omega-Regular Games - de Alfaro, Majumdar (2001) (6 citations) Self-citation (De alfaro) (Correct)
....obtained by replacing the predecessor operator Pre of classical calculus [14] by the controllable predecessor operator Cpre: for a set of states U , the set Cpre(U) consists of the states from which player 1 can force the game into U in one step. A richer version of game calculus was used in [6] to provide qualitative solutions for concurrent probabilistic games with regular conditions. There, multi argument predecessor operators are used to compute the set of states from which player 1 can win with probability 1, or arbitrarily close to 1. We introduce quantitative game calculus, ....
.... exist: one can only guarantee the existence of optimal strategies for all 0 [9] Third, whereas nite memory strategies suce for winning deterministic turn based games, in concurrent games both optimal strategies, and optimal strategies if they exist, may need an in nite amount of memory [6]. Fourth, the standard recursive structure of proofs for deterministic turn based games [19, 26] breaks down, as both players can choose a distribution over moves at each state. We develop the arguments both for deterministic and for probabilistic concurrent games. Hence, as a special case we ....
[Article contains additional citation context not shown here]
L. de Alfaro and T. Henzinger. Concurrent omega-regular games. In Proc. 15th IEEE Symp. Logic in Comp. Sci., pages 141-154, 2000.
On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003) (Correct)
No context found.
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proceedings of the 15th Annual Symposium on Logic in Computer Science, pages 141-154. IEEE Computer Society Press, 2000.
Nash Equilibrium for Upward-Closed Objectives - Chatterjee (2005) (Correct)
No context found.
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In LICS'00, pages 141-154. IEEE, 2000.
Two-player Nonzero-sum ω-regular Games - Chatterjee (2004) (Correct)
No context found.
L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In Proceedings of the 15th Annual Symposium on Logic in Computer Science, pages 141-154. IEEE Computer Society Press, 2000.
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