Stochastic omega-regular games

Stochastic ω-Regular Games

[1]  John H. Reif,et al.  Universal games of incomplete information , 1979, STOC.

[2]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Anne Condon,et al.  On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.

[4]  Orna Kupferman,et al.  Weak alternating automata and tree automata emptiness , 1998, STOC '98.

[5]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[6]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[7]  A. M. Fink,et al.  Equilibrium in a stochastic $n$-person game , 1964 .

[8]  Thomas A. Henzinger,et al.  The Element of Surprise in Timed Games , 2003, CONCUR.

[9]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[10]  Krishnendu Chatterjee,et al.  Concurrent games with tail objectives , 2006, Theor. Comput. Sci..

[11]  Thomas A. Henzinger,et al.  The Control of Synchronous Systems , 2000, CONCUR.

[12]  Mihalis Yannakakis,et al.  Markov Decision Processes and Regular Events (Extended Abstract) , 1990, ICALP.

[13]  Elon Kohlberg,et al.  The Asymptotic Theory of Stochastic Games , 1976, Math. Oper. Res..

[14]  Donald A. Martin,et al.  The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.

[15]  Florian Horn.  Streett Games on Finite Graphs , 2005 .

[16]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[17]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[18]  Annabelle McIver,et al.  Games, Probability and the Quantitative µ-Calculus qMµ , 2002, LPAR.

[19]  T. E. S. Raghavan,et al.  Algorithms for stochastic games — A survey , 1991, ZOR Methods Model. Oper. Res..

[20]  Thomas A. Henzinger,et al.  Discounting the Future in Systems Theory , 2003, ICALP.

[21]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[22]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  T. Henzinger,et al.  Trading memory for randomness , 2004 .

[24]  Alonzo Church,et al.  Logic, arithmetic, and automata , 1962 .

[25]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[26]  Thomas A. Henzinger,et al.  Abstract Interpretation of Game Properties , 2000, SAS.

[27]  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.

[28]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

[29]  Krishnendu Chatterjee,et al.  Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games , 2006, STACS.

[30]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[31]  Thomas A. Henzinger,et al.  Counterexample-Guided Control , 2003, ICALP.

[32]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Margus Veanes,et al.  Play to Test , 2005, FATES.

[34]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[35]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..

[36]  Thomas A. Henzinger,et al.  Symbolic algorithms for verification and control , 2003 .

[37]  R. Durrett.  Probability: Theory and Examples , 1993 .

[38]  Thomas A. Henzinger,et al.  Detecting Errors Before Reaching Them , 2000, CAV.

[39]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[40]  Thomas A. Henzinger,et al.  Fair Simulation , 1997, Inf. Comput..

[41]  Rupak Majumdar,et al.  Quantitative solution of omega-regular games , 2004, J. Comput. Syst. Sci..

[42]  N. Vieille.  Two-player stochastic games I: A reduction , 2000 .

[43]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[44]  S. Lippman,et al.  Stochastic Games with Perfect Information and Time Average Payoff , 1969 .

[45]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[46]  Piercesare Secchi,et al.  Stay-in-a-set games , 2002, Int. J. Game Theory.

[47]  Thomas A. Henzinger,et al.  The Control of Synchronous Systems, Part II , 2001, CONCUR.

[48]  Cyrus Derman,et al.  Finite State Markovian Decision Processes , 1970 .

[49]  Krishnendu Chatterjee,et al.  Strategy Improvement for Concurrent Reachability Games , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[50]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

[51]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[52]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[53]  Krishnendu Chatterjee,et al.  Generalized Parity Games , 2007, FoSSaCS.

[54]  Krishnendu Chatterjee,et al.  The Complexity of Stochastic Rabin and Streett Games' , 2005, ICALP.

[55]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[56]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[57]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[58]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[59]  Henrik Björklund,et al.  A Discrete Subexponential Algorithm for Parity Games , 2003, STACS.

[60]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[61]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[62]  Sylvain Sorin,et al.  Stochastic Games and Applications , 2003 .

[63]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[64]  Krishnendu Chatterjee,et al.  Simple Stochastic Parity Games , 2003, CSL.

[65]  Thomas A. Henzinger,et al.  Interface Theories for Component-Based Design , 2001, EMSOFT.

[66]  David M. Kreps,et al.  A Course in Microeconomic Theory , 2020 .

[67]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[68]  L. D. Alfaro.  The Verification of Probabilistic Systems Under Memoryless Partial-Information Policies is Hard , 1999 .

[69]  Damian Niwinski,et al.  Fixed Point Characterization of Infinite Behavior of Finite-State Systems , 1997, Theor. Comput. Sci..

[70]  Saugata Basu,et al.  New results on quantifier elimination over real closed fields and applications to constraint databases , 1999, JACM.

[71]  Krishnendu Chatterjee,et al.  Semiperfect-Information Games , 2005, FSTTCS.

[72]  Two-player Nonzero-sum !-regular Games , .

[73]  Rajeev Alur,et al.  Formal methods in system design , 1999, LICS 1999.

[74]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[75]  Krishnendu Chatterjee,et al.  Counterexample-guided Planning , 2005, UAI.

[76]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[77]  Krishnendu Chatterjee,et al.  Quantitative stochastic parity games , 2004, SODA '04.

[78]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[79]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[80]  Martín Abadi,et al.  Conjoining specifications , 1995, TOPL.

[81]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[82]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[83]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[84]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[85]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[86]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[87]  Kousha Etessami,et al.  Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.

[88]  I. Walukiewicz.  A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[89]  Anuj Dawar,et al.  Complexity Bounds for Regular Games , 2005, MFCS.

[90]  Krishnendu Chatterjee,et al.  Assume-Guarantee Synthesis , 2007, TACAS.

[91]  Thomas A. Henzinger,et al.  Concurrent omega-regular games , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[92]  Krishnendu Chatterjee,et al.  Strategy Improvement for Stochastic Rabin and Streett Games , 2006, CONCUR.

[93]  Krishnendu Chatterjee,et al.  The complexity of quantitative concurrent parity games , 2006, SODA '06.

[94]  Krishnendu Chatterjee,et al.  Stochastic Müller Games are PSPACE-Complete , 2007, FSTTCS.

[95]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[96]  Krishnendu Chatterjee,et al.  Stochastic limit-average games are in EXPTIME , 2008, Int. J. Game Theory.

[97]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[98]  Kedar S. Namjoshi,et al.  Abstract Patterns of Compositional Reasoning , 2003, CONCUR.

[99]  Krishnendu Chatterjee,et al.  Optimal Strategy Synthesis in Stochastic Müller Games , 2007, FoSSaCS.

[100]  Kousha Etessami,et al.  Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..

[101]  Amir Pnueli,et al.  Faster Solutions of Rabin and Streett Games , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[102]  Nicolas Vieille,et al.  Two-player stochastic games II: The case of recursive games , 2000 .

[103]  Igor Walukiewicz,et al.  Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..

[104]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[105]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[106]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[107]  Andrzej Wlodzimierz Mostowski,et al.  Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.

[108]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[109]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[110]  Krishnendu Chatterjee,et al.  Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..