Results 1 
3 of
3
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.
Synthesizing Distunguishing Formulae for Real Time Systems
, 1994
"... This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely, ..."
Abstract
 Add to MetaCart
This paper describes a technique for generating diagnostic information for the timed bisimulation equivalence and the timed simulation preorder. More precisely,
The Concurrency Workbench \Lambda
, 1989
"... Abstract The Concurrency Workbench is an automated tool that caters for the analysis of networks of finitestate processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its scope: a variety of different verification methods, including equivalence checking, preorder ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract The Concurrency Workbench is an automated tool that caters for the analysis of networks of finitestate processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its scope: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One experience from our work is that a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms. The Workbench has been applied to examples involving the verification of communications protocols and mutual exclusion algorithms and has proven a valuable aid in teaching and research.