Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
暂无分享,去创建一个
[1] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[2] E. Allen Emerson,et al. Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[3] Wolfgang Thomas,et al. Languages, Automata, and Logic , 1997, Handbook of Formal Languages.
[4] A. Puri. Theory of hybrid systems and discrete event systems , 1996 .
[5] Marcin Jurdzinski,et al. A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.
[6] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[7] Helmut Lescow,et al. Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions , 1996, TACAS.
[8] A. Prasad Sistla,et al. On Model-Checking for Fragments of µ-Calculus , 1993, CAV.