Game Development Reference
In-Depth Information
M. De Wulf, L. Doyen, and J.-F. Raskin. A lattice theory for solving games of
imperfect information. In Proc. of HSCC 2006: Hybrid Systems—Computation
and Control , Lecture Notes in Computer Science 3927, pages 153-168. Springer-
Verlag, 2006.
E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In
Proc. of FoCS: Foundations of Computer Science , pages 368-377. IEEE, 1991.
E. Filiot, N. Jin, and J.-F. Raskin. An antichain algorithm for LTL realizability. In
Proc. of CAV: Computer-aided verification , Lecture Notes in Computer Science
5643, pages 263-277. Springer, 2009.
O. Friedmann and M. Lange. The PGSolver collection of parity game solvers.
Technical report, Ludwig-Maximilians-Universitat Munchen, 2009.
V. Gripon and O. Serre. Qualitative concurrent games with imperfect information.
In Proc. of ICALP: Automata, Languages and Programming , 2009. To appear.
T. A. Henzinger. Games, time, and probability: Graph models for system design and
analysis. In Proc. of SOFSEM (1): Theory and Practice of Computer Science ,
Lecture Notes in Computer Science 4362, pages 103-110. Springer, 2007.
M. Jurdzinski. Small progress measures for solving parity games. In Proc.ofSTACS:
Theor. Aspects of Comp. Sc. , LNCS 1770, pages 290-301. Springer, 2000.
A. Kechris. Classical Descriptive Set Theory . Springer, Berlin, 1995.
D. Martin. Borel determinacy. Annals of Mathematics , 102(2):363-371, 1975.
J. H. Reif. The complexity of two-player games of incomplete information. Journal
of Computer and System Sciences , 29(2):274-301, 1984.
S. Safra. On the complexity of omega-automata. In Proc. of FOCS: Foundations of
Computer Science , pages 319-327. IEEE, 1988.
S. Schewe. An optimal strategy improvement algorithm for solving parity and payoff
games. In Proc. of CSL: Computer Science Logic , Lecture Notes in Computer
Science 5213, pages 369-384. Springer, 2008.
W. Thomas. Infinite games and verification. In Proc. of CAV: Computer Aided
Verification , Lecture Notes in Computer Science 2404, pages 58-64. Springer,
2002.
W. Thomas. On the synthesis of strategies in infinite games. In Proc. of STACS:
Symposium on Theoretical Aspects of Computer Science , volume 900 of Lecture
Notes in Computer Science , pages 1-13. Springer, 1995.
M. Vardi. Automatic verification of probabilistic concurrent finite-state systems.
In Proc. of FOCS: Foundations of Computer Science , pages 327-338. IEEE
Computer Society Press, 1985.
W. Zielonka. Infinite games on finitely coloured graphs with applications to automata
on infinite trees. Theoretical Computer Science , 200:135-183, 1998.
Search Nedrilad ::




Custom Search