In this paper, we present a verification method for concurrent finite-state systems that
attempts to avoid the part of the combinatorial explosion due to the modeling of concurrency …

The Concurrency Workbench is an automated tool for analyzing networks of finite-state
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …

We re-examine bisimulation equivalence for value-passing process languages in which
actions have associated with them values from a possibly infinite value set. Using symbolic …

Equivalence checking is a formal verification approach that consists in proving that two
programs or models are related modulo some equivalence relation, or that one is included …

This paper describes a procedure, based around the construction of tableau proofs, for
determining whether finite-state systems enjoy properties formulated in the propositional mu …

McMillan (1992) described a technique for deadlock detection based on net unfoldings. We
extend its applicability to the properties of a temporal logic with a possibility operator. The …

Parallel systems (such as operating systems, telecommunication systems, aircraft controlling
systems, banking systems, etc.) arise in many industrial applications. For applications where …

Direct embeddings of the full branching-time CTL∗ and its extension ECTL∗ into the modal
μ-calculus are presented. The embeddings use tableaux as intermediate representations of …

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 …

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 …