An ordered approach to solving parity games in quasi polynomial time and quasi linear space
暂无分享,去创建一个
Sanjay Jain | Sven Schewe | John Fearnley | Frank Stephan | Dominik Wojtczak | Sanjay Jain | F. Stephan | John Fearnley | S. Schewe | D. Wojtczak
[1] L. Goddard. Information Theory , 1962, Nature.
[2] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[3] Dexter Kozen,et al. Results on the Propositional µ-Calculus , 1982, ICALP.
[4] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.
[5] E. Emerson,et al. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.
[6] E. Allen Emerson,et al. Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[7] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[8] A. Prasad Sistla,et al. On Model-Checking for Fragments of µ-Calculus , 1993, CAV.
[9] Somesh Jha,et al. An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1994, Theor. Comput. Sci..
[10] Walter Ludwig,et al. A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem , 1995, Inf. Comput..
[11] A. Puri. Theory of hybrid systems and discrete event systems , 1996 .
[12] Somesh Jha,et al. An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1997, Theor. Comput. Sci..
[13] Wieslaw Zielonka,et al. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..
[14] Marcin Jurdziński,et al. Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..
[15] Moshe Y. Vardi. Reasoning about The Past with Two-Way Automata , 1998, ICALP.
[16] W. Zielonka. In nite games on nitely coloured graphs with applications to automata on in nite trees , 1998 .
[17] Thomas A. Henzinger,et al. Alternating-time temporal logic , 1999 .
[18] Marcin Jurdzinski,et al. A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.
[19] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[20] Thomas Wilke,et al. Alternating tree automata, parity games, and modal {$\mu$}-calculus , 2001 .
[21] Thomas A. Henzinger,et al. From verification to control: dynamic programs for omega-regular objectives , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[22] Jan Obdrzálek,et al. Fast Mu-Calculus Model Checking when Tree-Width Is Bounded , 2003, CAV.
[23] Henrik Björklund,et al. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..
[24] Nir Piterman,et al. From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[25] Uri Zwick,et al. A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.
[26] Bernd Finkbeiner,et al. Synthesis of Asynchronous Systems , 2006, LOPSTR.
[27] Stephan Kreutzer,et al. DAG-Width and Parity Games , 2006, STACS.
[28] Sven Schewe. Solving Parity Games in Big Steps , 2007, FSTTCS.
[29] Sven Schewe,et al. An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.
[30] Oliver Friedmann,et al. Solving Parity Games in Practice , 2009, ATVA.
[31] M. Lange,et al. The PGSolver Collection of Parity Game Solvers Version 3 , 2010 .
[32] John Fearnley,et al. Non-oblivious Strategy Improvement , 2010, LPAR.
[33] Oliver Friedmann,et al. Recursive algorithm for parity games requires exponential time , 2011, RAIRO Theor. Informatics Appl..
[34] Oliver Friedmann,et al. An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms , 2011, Log. Methods Comput. Sci..
[35] Keijo Heljanko,et al. Solving parity games by a reduction to SAT , 2012, Journal of computer and system sciences (Print).
[36] Sven Schewe,et al. Symmetric Strategy Improvement , 2015, ICALP.
[37] Krishnendu Chatterjee,et al. Improved Algorithms for One-Pair and k-Pair Streett Objectives , 2014, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.
[38] Lijun Zhang,et al. A Simple Algorithm for Solving Qualitative Probabilistic Parity Games , 2016, CAV.
[39] Cristian S. Calude,et al. Deciding parity games in quasipolynomial time , 2017, STOC.
[40] Marcin Jurdzinski,et al. Succinct progress measures for solving parity games , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[41] Sanjay Jain,et al. An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space , 2017, International Journal on Software Tools for Technology Transfer.