| Alternate document: Details The Complexity of Quantitative Concurrent Parity Games (04) Krishnendu Chatterjee, Luca de Alfaro Thomas A. Henzinger |
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger  Home/Search
Context Related
| berkeley.edu/techrepor...CSD041355.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/access...CSD041355 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The foundation of modeling and synthesizing reactive processes is the theory of graph games with !-regular winning conditions. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two solution problems for stochastic graph games: a qualitative problem, calling for the computation of the set of states from... (Update)
Cited by: More
On Computing Fixpoints in Well-Structured Regular Model.. - Baier Bertrand And (Correct)
Two-player Nonzero-sum ω-regular Games - Chatterjee (2004) (Correct)
Algorithms for Stochastic Parity Games - Chatterjee, Henzinger (2005) (Correct)
Active bibliography (related documents): More All
0.7: Quantitative Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2004) (Correct)
0.5: On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003) (Correct)
0.4: Nash Equilibrium for Upward-Closed Objectives - Chatterjee (2005) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
Related documents from co-citation: More All
2: On nonterminating stochastic games (context) - Hoffman, Karp - 1966
2: The Determinacy of Blackwell Games (context) - Martin - 1998
2: Competitive Markov Decision Processes (context) - Filar, Vrieze - 1996
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/chatterjee04complexity.html More
@misc{ chatterjee04complexity,
author = "K. Chatterjee and L. de Alfaro and T. Henzinger",
title = "The complexity of stochastic rabin and streett games",
text = "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.",
year = "2004",
url = "citeseer.ist.psu.edu/chatterjee04complexity.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
234 Supervisory control of a class of discrete-event processes (context) - Ramadge, Wonham - 1987
131 and logic (context) - Thomas, automata - 1997
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
110 the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
69 Competitive Markov Decision Processes (context) - Filar, Vrieze - 1997
52 Information and Computation (context) - Condon, of - 1992
42 and games (context) - Gurevich, Harrington et al. - 1982
34 Borel determinacy (context) - Martin - 1975
34 Automata on in nite objects (context) - Thomas - 1990
33 calculus and determinacy (context) - Emerson, Jutla - 1991
31 Markov decision processes and regular events (context) - Courcoubetis, Yannakakis - 1990
22 Formal Veri cation of Probabilistic Systems (context) - de Alfaro - 1997
19 Algorithms for stochastic games | a survey (context) - Raghavan, Filar - 1991
15 The determinacy of Blackwell games (context) - Martin - 1998
12 Concurrent reachability games - de Alfaro, Henzinger et al. - 1998
11 Solving sequential conditions by nitestate strategies (context) - uchi, Landweber - 1969
8 regular games (context) - de Alfaro, Henzinger - 2000
4 Quantitative stochastic parity games - Chatterjee, Jurdzi et al. - 2004
4 Simple stochastic parity games - Chatterjee, Jurdzi et al. - 2003
4 How much memory is needed to win in nite games (context) - Dziembowski, Jurdzi et al. - 1997
3 and the quantitative -calculus qm (context) - McIver, Morgan et al. - 2002
3 Trading memory for randomness (context) - Chatterjee, de Alfaro et al. - 2004
2 Perfect-information stochastic parity games (context) - Zielonka - 2004
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