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 …

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 …

Model checking is a very successful technique for verifying temporal properties of finite state
concurrent systems. It is standard to view this method as essentially algorithmic, and …

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 …

In this paper, we develop an algorithm for model checking that handles the full modal
mucalculus including alternating fixpoints. Our algorithm has a better worst-case complexity …

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 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 present a partial-order reduction technique for local model checking of hierarchical
networks of labeled transition systems in the weak modal mu-calculus. We have …

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 …

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 …