A selection property of the boolean $\mu $-calculus and some of its applications

DOI10.1051/ita/1997310403711zbMath0936.03030OpenAlexW1565810170MaRDI QIDQ4380557

André Arnold

Publication date: 15 May 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92567

zbMATH Keywords

Boolean algebracomplete latticegames on graphsautomatonmonotone mappingselectormodal mu-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Complete lattices, completions (06B23) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean functions (06E30)

Cites Work

• Unnamed Item
• An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
• A linear algorithm to solve fixed-point equations on transition systems
• An automata theoretic decision procedure for the propositional mu- calculus
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Model checking and boolean graphs
• Monadic second order logic on tree-like structures

This page was built for publication: A selection property of the boolean $\mu $-calculus and some of its applications