Games for the μ-calculus

Theoretical Computer Science

Volumn 163, Issue 1-2, 1996, Pages 99-116

  Niwiński, Damian ^a   Walukiewicz, Igor ^a,b  

^a UNIVERSITY OF WARSAW   (Poland)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; LOGIC PROGRAMMING; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

COMPLETENESS THEOREM; MARTIN'S DETERMINACY THEOREM; NATURAL SYSTEM; REFUTATIONS; SMALL MODEL THEOREM; SOUND LOGICAL RULES;

GAME THEORY;

EID: 0030215120     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00136-0     Document Type: Article

References (20)

1. Mads Dam, CTL* and ECTL* as a fragments of the modal μ-calculus, in: Proc. CAAP'92, Lecture Notes in Computer Science, Vol. 581 (Springer, New York, 1992) 145-165.
2. E.A. Emerson and E.M. Clark, Characterizing correctness properties of parallel programs using fixpoints, in: Proc. 7th Internat. Coll. on Automata, Languages and Programming (1980) 169-181.
3. E.A. Emerson and C.S. Jutla, The complexity of tree automata and logics of programs, in: Proc. 29th IEEE Symp. on Foundations of Computer Science (1988).
4. E.A. Emerson and C.S. Jutla, On simultaneously determinizing and complementing ω-automata, in: Proc. LICS'89 (1989).
5. E.A. Emerson and C.S. Jutla, Tree automata, mu calculus and determinacy, in: Proc. FOCS 91 (1991).
6. M.J. Fisher and R.E. Ladner, Propositional dynamic logic of regular programs, J. Comput. System Sci. 18 (2979) 194-211.
7. Y. Gurevich and L. Harrington, Trees, automata and games, J. ACM (1982).
8. D. Kozen, Results on the propositional μ-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
9. D. Kozen and R. Parikh, An elementary proof of the completeness of the PDL, Theoret. Comput. Sci. 14 (1981) 113-118.
10. D.A. Martin, Borel determinacy, Ann. Math. 102 (1975) 363-371.
11. Y.N. Moschovakis, Descriptive Set Theory, Studies in Logic, Vol. 100 (North-Holand, Amsterdam 1980).
12. A.A. Muchnik, Games on infinite trees and automata with dead ends, Semiotics and Information 24 (1984) 17-44 (in Russian).
13. D.M.R. Park, Fixpoint inductinon and proof of program semantics, in: B. Meltzer and D. Michie, eds., Machine Inteligence, Vol. 5 (Edinburgh University Press, Edinburgh, 1970) 59-78.
14. S. Safra, On the complexity of ω-automata, in: Proc. 29th IEEE Symp. on Foundations of Computer Science (1988).
15. C. Stirling, Modal and temporal logics for processes, Lecture Notes in Computer Science, to appear.
16. Colin P. Stirling and David J. Walker, Local model checking in the modal μ-calculus, Theoret. Comput. Sci. 89 (1991) 161-171.
17. Robert S. Streett and E. Allan Emerson, An automata theoretic procedure for the propositional μ-calculus, Inform. and Comput. 81 (1989) 249-264.
18. W. Thomas, Automata on infinite objects, in: J. van Leeuven, ed., Handbook of Theoretical Computer Science Vol. B. (Elsvier, Amsterdam, 1990) 995-1072.
19. I. Walukiewicz, A complete deductive system for the μ-Calculus, Ph.D Thesis, Warsaw University, 1993.
20. I. Walukiewicz, On completeness of the μ-calculcus, in: Proc. LICS'93 (IEEE Computer Society Press, Silver Spring, MD, 1993) 136-146.