Rance Cleaveland

Learn More
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-calculus. It presents a tableau-based proof system for the logic and proves it sound and complete, and it discusses techniques for the efficient construction of proofs that states(More)
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 breadth: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One(More)
We develop a model-checking algorithm for a logic that permits propositions to be deened using greatest and least xed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identiied by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and(More)
We propose an extension to Message Sequence Charts called <i>Triggered Message Sequence Charts</i> (TMSCs) that are intended to capture system specifications involving nondeterminism in the form of <i>conditional scenarios.</i> The visual syntax of TMSCs closely resembles that of MSCs; the semantics allows us to translate a TMSC specification into a(More)