Geodesic
A selection property of the boolean μ-calculus and some of its applications
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 4, pp. 371-384.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1997__31_4_371_0,
     author = {Arnold, Andr\'e},
     title = {A selection property of the boolean $\mu $-calculus and some of its applications},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {371--384},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {4},
     year = {1997},
     mrnumber = {1605787},
     zbl = {0936.03030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1997__31_4_371_0/}
}
TY  - JOUR
AU  - Arnold, André
TI  - A selection property of the boolean $\mu $-calculus and some of its applications
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 371
EP  - 384
VL  - 31
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1997__31_4_371_0/
LA  - en
ID  - ITA_1997__31_4_371_0
ER  - 
%0 Journal Article
%A Arnold, André
%T A selection property of the boolean $\mu $-calculus and some of its applications
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 371-384
%V 31
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1997__31_4_371_0/
%G en
%F ITA_1997__31_4_371_0
Arnold, André. A selection property of the boolean $\mu $-calculus and some of its applications. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 4, pp. 371-384. http://geodesic.mathdoc.fr/item/ITA_1997__31_4_371_0/

1. H. R. Andersen, Model checking and boolean graphs. Theor. Comp. Sci., 1994, 126, pp. 3-30. | Zbl | MR

2. A. Arnold, An initial semantics for the μ-calculus on trees and Rabin's complementation lemma. Theor. Comp. Sci., 1995, 148, pp. 121-132. | Zbl | MR

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. | Zbl | MR

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. | Zbl | MR

5. R. Mcnaughton, Infinite games played on finite graphs. Annals of Pure and Applied Logic, 1993, 65, pp. 149-184. | Zbl | MR

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. | Zbl | MR

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. | MR

8. I. Walukiewicz, Monadic second order logic on tree-like structures. In STACS'96, p. 401-414. Lect. Notes Comput. Sci., 1996, 1046. | MR

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.