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 …

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 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 …

We present an incremental algorithm for model checking in the alternation-free fragment of
the modal mu-calculus, the first incremental algorithm for model checking of which we are …

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 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 …

This paper deals with the problem of verifying the correctness of a finite-state parallel system
presented in terms of a finite labeled transition system. More precisely, we consider logical …

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 …