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)
Similar documents based on text:
0.0: Unknown - (Correct)
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
[Article contains additional citations not shown here]
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