Model checking games

Electronic Notes in Theoretical Computer Science

Volumn 67, Issue , 2002, Pages 17-36

  Grädel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Complexity; Fixed point logic; Games; Logic; Model checking; Parity games

Indexed keywords

COMPLEXITY; FIXED-POINT LOGIC; GAMES; LOGIC; MODEL CHECKING; PARITY GAMES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; GAME THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

LOGIC PROGRAMMING;

EID: 18944368425     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80538-3     Document Type: Conference Paper

References (16)

1. Arnold A., Niwiński D. "Rudiments of μ-calculus" 2001;North Holland
2. Bradfield J., Stirling C. Modal logics and mu-calculi. Bergstra J., Ponse A., Smolka S. Handbook of Process Algebra. 2001;293-332 Elsevier
3. Dowling W.F., Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional horn formulae. LOGIC PROGRAM. (USA) ISSN: 0743-1066. 1:1984;267-284
4. Dziembowski S., Bounded-variable fixpoint queries are PSPACE-complete, in: 10th Annual Conference on Computer Science Logic CSL 96. Selected papers, Lecture Notes in Computer Science 1258, Springer, 1996 pp. 89-105.
5. Emerson A. and C. Jutla, Tree automata, mu-calculus and determinacy, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, pp. 368-377.
6. Grädel E., Otto M. On logics with two variables. Theoretical Computer Science. 224:1999;73-113
7. Greenlaw R., Hoover J., Ruzzo W. "Limits to Parallel Computation. P-Completeness Theory" 1995;Oxford University Press
8. Itai A., Makowsky J. Unification as a complexity measure for logic programming. Journal of Logic Programming. 4:1987;105-117
9. Jurdziński M. Deciding the winner in parity games is in UP ∩ Co-UP. Information Processing Letters. 68:1998;119-124
10. Jurdziński M., Small progress measures for solving parity games, in: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, Lecture Notes in Computer Science 1770 (2000), pp. 290-301.
11. Martin D. Borel determinacy. Annals of Mathematics. 102:1975;336-371
12. Thomas W., On the synthesis of strategies in infinite games, in: Proceedings of STACS 95, Lecture Notes in Computer Science Nr. 900 (1995), pp. 1-13.
13. Thomas W. Languages, automata, and logic. Rozenberg G., Salomaa A. Handbook of Formal Languages. Volume 3:1997;389-455 Springer, New York
14. Vardi M., The complexity of relational query languages, in: Proceedings of the 14th ACM Symposium on the Theory of Computing, 1982, pp. 137-146.
15. Vardi M., On the complexity of bounded-variable queries, in: Proc. 14th ACM Symp. on Principles of Database Systems, 1995, pp. 266-267.
16. Zielonka W. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science. 200:1998;135-183