The complexity of stochastic Müller games
暂无分享,去创建一个
[1] Wieslaw Zielonka,et al. Perfect-Information Stochastic Parity Games , 2004, FoSSaCS.
[2] Anne Condon,et al. On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.
[3] Krishnendu Chatterjee,et al. The Complexity of Stochastic Rabin and Streett Games' , 2005, ICALP.
[4] Mihalis Yannakakis,et al. Markov Decision Processes and Regular Events (Extended Abstract) , 1990, ICALP.
[5] J. Filar,et al. Competitive Markov Decision Processes , 1996 .
[6] Krishnendu Chatterjee,et al. Trading memory for randomness , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..
[7] Wieslaw Zielonka,et al. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..
[8] Krishnendu Chatterjee,et al. Quantitative stochastic parity games , 2004, SODA '04.
[9] Thomas A. Henzinger,et al. Symbolic algorithms for verification and control , 2003 .
[10] Yuri Gurevich,et al. Trees, automata, and games , 1982, STOC '82.
[11] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..
[12] Wolfgang Thomas,et al. Languages, Automata, and Logic , 1997, Handbook of Formal Languages.
[13] Donald A. Martin,et al. The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.
[14] T. E. S. Raghavan,et al. Algorithms for stochastic games — A survey , 1991, ZOR Methods Model. Oper. Res..
[15] Diana Fischer,et al. The quantitative µ-calculus , 2013 .
[16] Krishnendu Chatterjee,et al. Stochastic Müller Games are PSPACE-Complete , 2007, FSTTCS.
[17] Amir Pnueli,et al. On the synthesis of a reactive module , 1989, POPL '89.
[18] Igor Walukiewicz,et al. How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[19] Krishnendu Chatterjee,et al. Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games , 2006, STACS.
[20] Zohar Manna,et al. The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.
[21] Florian Horn. Dicing on the Streett , 2007, Inf. Process. Lett..
[22] Thomas A. Henzinger,et al. Concurrent omega-regular games , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[23] Hugo Gimbert,et al. Perfect Information Stochastic Priority Games , 2007, ICALP.
[24] Anne Condon,et al. The Complexity of Stochastic Games , 1992, Inf. Comput..
[25] Zohar Manna,et al. Formal verification of probabilistic systems , 1997 .
[26] Annabelle McIver,et al. Games, Probability and the Quantitative µ-Calculus qMµ , 2002, LPAR.
[27] P. Ramadge,et al. Supervisory control of a class of discrete event processes , 1987 .
[28] Kousha Etessami,et al. Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.
[29] Anuj Dawar,et al. Complexity Bounds for Regular Games , 2005, MFCS.
[30] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .
[31] Krishnendu Chatterjee,et al. Concurrent games with tail objectives , 2006, Theor. Comput. Sci..
[32] Damian Niwinski,et al. Fixed Point Characterization of Infinite Behavior of Finite-State Systems , 1997, Theor. Comput. Sci..
[33] Krishnendu Chatterjee,et al. Simple Stochastic Parity Games , 2003, CSL.