Church Synthesis Problem for Noisy Input
暂无分享,去创建一个
[1] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Ian Stark,et al. Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.
[3] A. Ehrenfeucht,et al. Positional strategies for mean payoff games , 1979 .
[4] Krishnendu Chatterjee,et al. Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[5] Gregory F. Sullivan,et al. Detecting cycles in dynamic graphs in polynomial time , 1988, STOC '88.
[6] Lukasz Kaiser,et al. Degrees of Lookahead in Regular Infinite Games , 2010, FoSSaCS.
[7] Tomás Brázdil,et al. Reachability Games on Extended Vector Addition Systems with States , 2010, ICALP.
[8] Krishnendu Chatterjee,et al. Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..
[9] Krishnendu Chatterjee,et al. Generalized Mean-payoff and Energy Games , 2010, FSTTCS.
[10] Henrik Björklund,et al. Memoryless determinacy of parity and mean payoff games: a simple proof , 2004, Theor. Comput. Sci..
[11] Thomas Wilke,et al. Automata logics, and infinite games: a guide to current research , 2002 .
[12] Thomas Wilke,et al. Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.
[13] Paul Gastin,et al. CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.
[14] Krishnendu Chatterjee,et al. Algorithms for Omega-Regular Games with Imperfect Information, , 2006, CSL.
[15] Rajeev Alur,et al. On Omega-Languages Defined by Mean-Payoff Conditions , 2009, FoSSaCS.
[16] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[17] Krishnendu Chatterjee,et al. Mean-Payoff Automaton Expressions , 2010, CONCUR.
[18] John H. Reif,et al. The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..
[19] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[20] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..
[21] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .
[22] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[23] Krishnendu Chatterjee,et al. Energy Parity Games , 2010, ICALP.
[24] Szymon Torunczyk,et al. Energy and Mean-Payoff Games with Imperfect Information , 2010, CSL.