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 …

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 …

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 …

We present a local model checking algorithm that decides for a given contextfree process
whether it satisfies a property written in the alternation-free modal mu-calculus. Heart of this …

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 that decides for a given context-free process
whether it satisfies a property written in the alternation-free modal mu-calculus. The central …

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 …

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 …

We describe how model-checking games can be the foundation for efficient local model-
checking of the modal mu-calculus on transition systems. Game-based algorithms generate …

It is known that pushdown processes have a decidable monadic second-order theory (Muller
and Schupp, Theoret. Comput. Sci. 37 (1985) 51–; 75) and that this result covers the model …