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

André Arnold

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1997)

  • Volume: 31, Issue: 4, page 371-384
  • ISSN: 0988-3754

How to cite

top

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 31.4 (1997): 371-384. <http://eudml.org/doc/92567>.

@article{Arnold1997,
author = {Arnold, André},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Boolean algebra; complete lattice; monotone mapping; games on graphs; modal mu-calculus; automaton; selector},
language = {eng},
number = {4},
pages = {371-384},
publisher = {EDP-Sciences},
title = {A selection property of the boolean $\mu $-calculus and some of its applications},
url = {http://eudml.org/doc/92567},
volume = {31},
year = {1997},
}

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
PB - EDP-Sciences
VL - 31
IS - 4
SP - 371
EP - 384
LA - eng
KW - Boolean algebra; complete lattice; monotone mapping; games on graphs; modal mu-calculus; automaton; selector
UR - http://eudml.org/doc/92567
ER -

References

top
  1. 1. H. R. ANDERSEN, Model checking and boolean graphs. Theor. Comp. Sci., 1994, 126, pp. 3-30. Zbl0798.03017MR1268020
  2. 2. A. ARNOLD, An initial semantics for the μ-calculus on trees and Rabin's complementation lemma. Theor. Comp. Sci., 1995, 148, pp. 121-132. Zbl0873.68157MR1347671
  3. 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. Zbl0663.68075MR974202
  4. 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. Zbl0794.03054MR1196736
  5. 5. R. MCNAUGHTON, Infinite games played on finite graphs. Annals of Pure and Applied Logic, 1993, 65, pp. 149-184. Zbl0798.90151MR1257468
  6. 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. Zbl0671.03023MR1000065
  7. 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. MR1252008
  8. 8. I. WALUKIEWICZ, Monadic second order logic on tree-like structures. In STACS'96, p. 401-414. Lect. Notes Comput. Sci., 1996, 1046. MR1462113
  9. 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. Zbl0915.68120

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.