A selection property of the Boolean μ-calculus and some of its applications

Theoretical Informatics and Applications

Volumn 31, Issue 4, 1997, Pages 371-384

  Arnold, André ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031316997     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1997310403711     Document Type: Article

References (9)

1. H. R. ANDERSEN, Model checking and boolean graphs. Theor. Comp. Sci., 1994, 126, pp. 3-30.
2. A. ARNOLD, An initial semantics for the μ-calculus on trees and Rabin's complementation lemma. Theor. Comp. Sci., 1995, 148, pp. 121-132.
3. A. ARNOLD and P. CRUBILLÉ, A linear algorithm to solve fixed-point equations on transition systems. Information Processing Letters, 1988, 29, pp. 57-66.
4. A. ARNOLD and D. NIWIŃSKI, Fixed point characterization of weak monadic logic definable sets of trees. In M. Nivat and A. Podelski, editors, Tree Automata and Languages, 1992, pp. 159-188, Elsevier.
5. R. MCNAUGHTON, Infinite games played on finite graphs. Annals of Pure and Applied Logic, 1993, 65, pp. 149-184.
6. R. S. STREETT and E. A. EMERSON, An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 1989, 81, pp. 249-264.
7. B. VERGAUWEN and J. LEWI, A linear algorithm for solving fixed-point equations on transition systems. In J.-C. Raoult, editor, CAAP'92, p. 321-341. Lect. Notes Comput. Sci., 1992, 581.
8. I. WALUKIEWICZ, Monadic second order logic on tree-like structures. In STACS'96, p. 401-414. Lect. Notes Comput. Sci., 1996, 1046.
9. W. ZIELONKA, Infinite games on finitely coloured graphs with applications to automata on infinite trees. Technical Report 1091-95, LaBRI, Université Bordeaux I, 1995.