On model checking for the μ-calculus and its fragments

https://doi.org/10.1016/S0304-3975(00)00034-7Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we consider the model checking problem for the μ-calculus and show that it is succinctly equivalent to the non-emptiness problem of finite-state automata on infinite binary trees with the parity acceptance condition. We also present efficient model checking algorithms for two rich subclasses of the μ-calculus formulas and relate their expressive power to well-known extensions of branching time temporal logics.

Keywords

Model checking
μ-calculus
Tree automata
Expressiveness
Temporal logic

Cited by (0)

1

This author's research is supported in part by NSF grant CCR-980-4736, Semiconductor Research Corporation contract 99-TJ-685, and Texas Advanced Research Program project 003658-0650-1999.

2

This author's research is supported in part by NSF grants CCR-9623229, CCR-9212183, CCR-9633536.