Results 1 
5 of
5
TableauBased Model Checking in the Propositional MuCalculus
 Acta Informatica
, 1990
"... This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses tech ..."
Abstract

Cited by 102 (7 self)
 Add to MetaCart
(Show Context)
This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses techniques for the efficient construction of proofs that states enjoy properties expressed in the logic. The approach is the basis of an ongoing implementation of a model checker in the Concurrency Workbench, an automated tool for the analysis of concurrent systems. 1 Introduction One area of program verification that has proven amenable to automation involves the analysis of finitestate processes. While computer systems in general are not finitestate, many interesting ones, including a variety of communication protocols and hardware systems, are, and their finitary nature enables the development and implementation of decision procedures that test for various properties. Model checking has p...
Conformance checking for models of asynchronous message passing software
 In Proc. of the Int. Conf. on Computer Aided Verification
, 2002
"... Abstract. We propose a notion of conformance between a specification S andanimplementationmodelI extracted from a messagepassing program. In our framework, S and I are CCS processes, which soundly abstract the externallyvisible communication behavior of a messagepassing program. We use the extracte ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a notion of conformance between a specification S andanimplementationmodelI extracted from a messagepassing program. In our framework, S and I are CCS processes, which soundly abstract the externallyvisible communication behavior of a messagepassing program. We use the extracted models to check that programs do not get stuck, waiting to receive or trying to send messages in vain. We show that our definition of stuckness and conformance capture important correctness conditions of messagepassing software. Our definition of conformance was motivated bythe need for modular reasoning over models, leading to the requirement that conformance preserve substitutabilitywith respect to stuckfreeness: If I conforms to S, andP is anyenvironment such that P  S is stuckfree, then it follows that P  I is stuckfree. We present a simple algorithm for checking if I conforms to S, whenI and S obeycertain restrictions. 1
On Automatically Explaining Bisimulation Inequivalence
 Proceedings of the 2nd International Workshop on Computer Aided Verification, Lecture Notes In Computer Science; Vol. 531
, 1990
"... This paper describes a technique for generating a logical formula that differentiates between two bisimulationinequivalent finitestate systems. The method works in conjunction with a partitionrefinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This paper describes a technique for generating a logical formula that differentiates between two bisimulationinequivalent finitestate systems. The method works in conjunction with a partitionrefinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal in a precisely defined sense.
A Theory for Simulator Tools
 in Process Algebra, Department of Software Technology CWI
, 1992
"... This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ()CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the explored process t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This paper presents a possible formalisation of the notion simulator tool for process languages like ACP, CCS, ()CRL, LOTOS and PSF. First we give precise definitions for the notions simulator and simulation. Then we can investigate the equivalence that a simulator induces on the explored process terms. This is done by considering two processes, say p and q; equivalent if each simulation of p is also a simulation of q and vice versa. It is proven that there is no `reasonable' simulator inducing bisimulation equivalence. Furthermore it is demonstrated that simulators inducing coarser equivalences, e.g. ready, failure and trace equivalences, are unlikely to be computationally tractable. Our conclusion is that a practical simulator induces an equivalence that is finer (less identifying) than bisimulation and even finer than graph isomorphism.