The modal mu-calculus, due to Pratt and Kozen [12, 8], is a natural extension of dynamic
logic. It is also one method of obtaining a branching time temporal logic from a modal logic …

The modal mu-calculus, due to Pratt and Kozen [Pr, Ko], is a natural extension of dynamic
logic. It is also one method of obtaining a branching time temporal logic from a modal logic …

We develop a model-checking algorithm for a logic that permits propositions to be defined
with greatest and least fixed points of mutually recursive systems of equations. This logic is …

We present a sound and complete tableau proof system for establishing whether a set of
elements of an arbitrary transition system model has a property expressed in (a slight …

We briefly survey the background and history of modal and temporal logics. We then
concentrate on the modal mu-calculus, a modal logic which subsumes most other commonly …

We develop a model-checking algorithm for a logic that permits propositions to be defined
using greatest and least fixed points of mutually recursive systems of equations. This logic is …

We develop a model-checking algorithm that decides for a given context-free process
whether it satisfies a property written in the alternation-free modal mu-calculus. The central …

This paper develops efficient local model-checking algorithms for expressive fragments of
the modal Μ-calculus. The time complexity of our procedures matches that of the best …

This note presents a straightforward algorithm for checking whether or not a state of a
labelled transition system satisfies an assertion in the modal ν-calculus and μ-calculus. The …

This paper develops a model-checking algorithm for a fragment of the modal mu-calculus
and shows how it may be applied to the efficient computation of behavioral relations …