Finite-state Strategies in Delay Games (full version)
暂无分享,去创建一个
[1] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[2] Igor Walukiewicz. Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..
[3] Krishnendu Chatterjee,et al. The Complexity of Request-Response Games , 2011, LATA.
[4] Sanjay Jain,et al. An ordered approach to solving parity games in quasi polynomial time and quasi linear space , 2017, SPIN.
[5] Arno Pauly,et al. Extending Finite Memory Determinacy to Multiplayer Games , 2016, SR.
[6] 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.
[7] A. Pnueli,et al. On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.
[8] D. Siefkes. Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees , 1972 .
[9] Karoliina Lehtinen,et al. A modal μ perspective on solving parity games in quasi-polynomial time , 2018, LICS.
[10] Christof Löding,et al. Degrees of Lookahead in Context-free Infinite Games , 2011, CSL.
[11] Martin Zimmermann,et al. Games with costs and delays , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[12] Felix Klein,et al. How Much Lookahead is Needed to Win Infinite Games? , 2014, Log. Methods Comput. Sci..
[13] Wolfgang Thomas,et al. Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications , 2003, CIAA.
[14] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .
[15] Martin Zimmermann,et al. Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs , 2016, Log. Methods Comput. Sci..
[16] Alexander Moshe Rabinovich,et al. Synthesis of Finite-state and Definable Winning Strategies , 2009, FSTTCS.
[17] Igor Walukiewicz,et al. Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..
[18] Bakhadyr Khoussainov,et al. Cdmtcs Research Report Series Finite State Strategies in One Player Mcnaughton Games Finite State Strategies in One Player Mcnaughton Games , 2022 .
[19] Martin Fränzle,et al. What's to Come is Still Unsure - Synthesizing Controllers Resilient to Delayed Interaction , 2018, ATVA.
[20] Florian Horn,et al. Les jeux d'accessibilité généralisée , 2013, Tech. Sci. Informatiques.
[21] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .
[22] Sarah Winter,et al. Finite-state Strategies in Delay Games , 2017, GandALF.
[23] Mikolaj Bojanczyk,et al. Weak MSO with the Unbounding Quantifier , 2009, Theory of Computing Systems.
[24] Martin Zimmermann,et al. Delay Games with WMSO+U Winning Conditions , 2014, RAIRO Theor. Informatics Appl..
[25] J. Taylor,et al. Playing safe? , 1989, Nursing times.
[26] Florian Horn. Streett Games on Finite Graphs , 2005 .
[27] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .
[28] Cristian S. Calude,et al. Deciding parity games in quasipolynomial time , 2017, STOC.
[29] Felix Klein,et al. Prompt Delay , 2016, FSTTCS.
[30] Florian Horn,et al. The surprizing complexity of reachability games , 2010, ArXiv.
[31] E. Emerson,et al. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.
[32] Felix Klein,et al. What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead , 2015, CSL.
[33] Lukasz Kaiser,et al. Degrees of Lookahead in Regular Infinite Games , 2010, Log. Methods Comput. Sci..
[34] Marcin Jurdzinski,et al. Succinct progress measures for solving parity games , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[35] Wolfgang Thomas,et al. Finite-State Strategies in Regular Infinite Games , 1994, FSTTCS.
[36] Lawrence H. Landweber,et al. Finite Delay Solutions for Sequential Conditions , 1972, ICALP.
[37] Thomas Wilke,et al. Automata logics, and infinite games: a guide to current research , 2002 .