Results 1 
8 of
8
Testing Equivalence as a Bisimulation Equivalence
 Formal Aspects of Computing
, 1993
"... In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way that the te ..."
Abstract

Cited by 65 (11 self)
 Add to MetaCart
In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way that the testing relations on the original systems correspond to (pre)bisimulation relations on the altered systems. Using these results, it is possible to use algorithms for determining the (pre)bisimulation relations in the case of finitestate transition systems to compute the testing relations.
Compositional Minimisation of Finite State Systems Using Interface Specifications
, 1996
"... We present a method for the compositional construction of the minimal transition system that represents the semantics of a given distributed system. Our aim is to control the state explosion caused by the interleavings of actions of communicating parallel components by reduction steps that exploit g ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
We present a method for the compositional construction of the minimal transition system that represents the semantics of a given distributed system. Our aim is to control the state explosion caused by the interleavings of actions of communicating parallel components by reduction steps that exploit global communication constraints given in terms of interface specifications. The effect of the method, which is developed for bisimulation semantics here, depends on the structure of the distributed system under consideration, and the accuracy of the interface specifications. However, its correctness is independent of the correctness of the interface specifications provided by the program designer.
The Edinburgh Concurrency Workbench (Version 7.1)
, 1997
"... This document is intended to serve as an introduction only to the CWB. Some amount of description is contained within this document on the semantic interpretation of terms representing concurrent systems. However, the document is intended for readers already familiar with Process Algebra in some for ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
This document is intended to serve as an introduction only to the CWB. Some amount of description is contained within this document on the semantic interpretation of terms representing concurrent systems. However, the document is intended for readers already familiar with Process Algebra in some form, such as the Calculus of Communicating Systems (CCS), as well as the operational semantic definition of the terms in such an algebra. Those unfamiliar with these concepts are referred to the list of references which follows the main body of the text
Derivation of Characteristic Formulae
, 2001
"... This paper shows how modal mucalculus formulae characterizing finitestate processes up to strong or weak bisimulation can be derived directly from the wellknown greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
This paper shows how modal mucalculus formulae characterizing finitestate processes up to strong or weak bisimulation can be derived directly from the wellknown greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation case and, by virtue of derivation, immediately generalizes to various other bisimulationlike relations, in particular weak bisimulation.
An Algebraic Theory of Process Efficiency
 In LICS ’96
, 1996
"... This paper presents a testingbased semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractn ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This paper presents a testingbased semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulationbased efficiency preorders. An example is provided to illustrate the utility of this approach. 1. Introduction Process algebras [12, 10, 3] have attracted substantial attention over the past decade and a half as frameworks for system verification. A hallmark of these theories is the development of behavioral equivalences and preorders that relate systems on the basis of their extensional behavior. In these frameworks, specifications are usually given as "highlevel " systems; to prove a system meets such a specification, one shows that they are related appropriately by such a behavioral relation. When the behavioral relation is...
Compositional Minimization of Finite State Systems Using Interface Specifications
, 1995
"... In this paper we present a method for the compositional construction of the minimal transition system that represents the semantics of a given distributed system. Our aim is to control the state explosion caused by the interleavings of actions of communicating parallel components by reduction steps ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
In this paper we present a method for the compositional construction of the minimal transition system that represents the semantics of a given distributed system. Our aim is to control the state explosion caused by the interleavings of actions of communicating parallel components by reduction steps that exploit global communication constraints given in terms of interface specifications. The effect of the method, which is developed for bisimulation semantics here, depends on the structure of the distributed system under consideration, and the accuracy of the interface specifications. However, its correctness does not: every "successful" construction is guaranteed to yield the desired minimal transition system, independent of the correctness of the interface specifications provided by the program designer.
The Edinburgh Concurrency Workbench user manual (Version 7.1)
"... CONTENTS 2 Contents 1 Introduction 3 2 Using the Concurrency Workbench 3 3 Using the CWB from emacs 4 4 Basic format and syntax of input 4 4.1 The very basics of CWB format . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.2 Variables and identifiers . . . . . . . . . . . . . . . . . . . . . ..."
Abstract
 Add to MetaCart
CONTENTS 2 Contents 1 Introduction 3 2 Using the Concurrency Workbench 3 3 Using the CWB from emacs 4 4 Basic format and syntax of input 4 4.1 The very basics of CWB format . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4.2 Variables and identifiers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 5 The languages understood by the CWB 5 5.1 (T)CCS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 5.2 SCCS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 5.3 The modal mu calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 6 Environments 14 7 Another Example Session 15 8 The Commands of the CWB 16 8.1 Using online help . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 8.2 Quitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 8.3 Defining things and maintaining the en