The thesis is concerned with veri cation of properties of concurrent systems expressed in the
modal-calculus. This approach is called model-checking. The modal-calculus contains …

We present global and local algorithms for evaluating minimal fixed points of dependency
graphs, a general problem in fixed-point computation and model checking. Our algorithms …

Many automated finite-state verification procedures can be viewed as fixpoint computations
over a finite lattice (typically the powerset of the set of system states). Hence, fixpoint calculi …

This paper studies the semantics of a central part of the Unified Modeling Language UML. It
discusses UML class, object and state diagrams and presents a new integrated semantics …

Many automated finite-state verification procedures can be viewed as fixpoint computations
over a finite lattice (typically the powerset of the set of system states). For this reason, fixpoint …

The paper develops a framework that is based on the idea that modal logic provides an
appropriate framework for the specification of data flow analysis (DFA) algorithms as soon …

We review, in a unified framework, translations from five different logics—monadic second-
order logic of one and two successors (S1S and S2S), linear-time temporal logic (LTL) …

We give an alternative proof of the result of Long et al.(1994) that nested fixpoint
expressions e of alternation depth d> 1 can be evaluated over a complete lattice of height h …

We present a proof system for determining satisfaction between processes in a fairly general
process algebra and assertions of the modal/spl mu/-calculus. The proof system is …

We define five increasingly comprehensive classes of infinite-state systems, called STS1--
STS5, whose state spaces have finitary structure. For four of these classes, we provide …