Results 1 
4 of
4
A semanticsbased verification tool for finitestate systems
 IN PROC. OF PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION, IX
, 1990
"... The Concurrency Workbench is an automated tool that caters for the analysis of concurrent 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 ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
The Concurrency Workbench is an automated tool that caters for the analysis of concurrent 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. We will present the architecture of the Workbench and illustrate the verification methods through some simple examples.
Minimizing The Number Of Transitions With Respect To Observation Equivalence
"... Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, many behavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem: Given a ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, many behavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem: Given a finite lts, which is the minimal observation equivalent lts corresponding to it ? It is well known that the number of states of an lts can be minimized by applying an relational coarsest partition algorithm. However, the obtained lts is not unique (up to the renaming of the states): for an lts there may exist several observation equivalent lts's which have the minimal number of states but varying number of transitions. In this paper we show how the number of transitions can be minimized, obtaining a unique lts. CR categories: F.1.1, F.3.1. Key words: Labeled transition system, Observation equivalence, Minimization, Uniqueness. 1 Introduction. In order to discern the relevant properties of a ...
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.
A Theory of Testing for RealTime\Lambda
"... Abstract This paper develops a framework for generating testing preorders that relate processes on the basis of their timing behavior as well as their degree of relative nondeterminism. The framework is then applied to two different scenarios. In the first, relations are constructed that relate proc ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract This paper develops a framework for generating testing preorders that relate processes on the basis of their timing behavior as well as their degree of relative nondeterminism. The framework is then applied to two different scenarios. In the first, relations are constructed that relate processes on the basis of all timing considerations. In the second, relations are constructed that relate processes on the basis of their relative speeds. In both cases, alternative denotational characterizations of the resulting preorders are presented, and examples are given to illustrate the utility of the approach.