Article contents
Domain mu-calculus
Published online by Cambridge University Press: 15 January 2004
Abstract
The basic framework of domain μ-calculus was formulated in [39] more than ten years ago. This paper provides an improved formulation of a fragment of the μ-calculus without function space or powerdomain constructions, and studies some open problems related to this μ-calculus such as decidability and expressive power. A class of language equations is introduced for encoding μ-formulas in order to derive results related to decidability and expressive power of non-trivial fragments of the domain μ-calculus. The existence and uniqueness of solutions to this class of language equations constitute an important component of this approach. Our formulation is based on the recent work of Leiss [23], who established a sophisticated framework for solving language equations using Boolean automata (a.k.a. alternating automata [12,35]) and a generalized notion of language derivatives. Additionally, the early notion of even-linear grammars is adopted here to treat another fragment of the domain μ-calculus.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 37 , Issue 4: Fixed Points in Computer Science (FICS'02) , October 2003 , pp. 337 - 364
- Copyright
- © EDP Sciences, 2003
References
- 3
- Cited by