Automata for the modal μ-calculus and related results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 969, Issue , 1995, Pages 552-562

  Janin, David ^a   Walukiewicz, Igor ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; ROBOTS;

DISJUNCTIVE FORMULAS; EXPRESSIVE POWER; MODAL MU CALCULUS; MU-CALCULUS; SATISFIABILITY CHECKING; TRANSITION SYSTEM;

TEMPORAL LOGIC;

EID: 84947903049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60246-1_160     Document Type: Conference Paper

References (9)

1. O. Bernholtz and O. Grumberg. Branching time temporal logic and amorphous tree automata. In Proc. 4th Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 262-277. Springer-Verlag, 1993.
2. E.A. Emerson and C.S. Jutla. The complexity of tree automata and logics of programs. In 29th IEEE Syrup. on Foundations of Computer Science, 1988.
3. E.A. Emerson and C.S. Jutla. Tree automata, mu calculus and determinacy. In Proc. FOCS 91, 1991.
4. D. Kozen. Results on the propositional ran-calculus. Theoretical Computer Science, 27:333-354, 1983.
5. D. Kozen. A finite model theorem for the propositional μ-calculus. Studa Logica, 47(3):234-241, 1988.
6. A.W. Mostowski. Regular expressions for infinite trees and a standard form of automta. In A. Skowron, editor, Fith Symposium on Computation Theory, volume 208 of LNCS, pages 157-168, 1984.
7. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54:267-276, 1987.
8. D. Niwiński. Fixed points vs. infinite generation. In Proc. 3rd. IEEE LICS, pages 402-409, 1988.
9. R.S. Street and E.A. Emerson. An automata theoretic procedure for the propositional mu-calculus. Information and Computation, 81:249-264, 1989.