Results 1 
4 of
4
Focus points and convergent process operators: A proof strategy for protocol veri cation
, 1995
"... We present a strategy for nding algebraic correctness proofs for communication systems. It is described in the setting of CRL [11], which is, roughly, ACP [2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in [4] ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
We present a strategy for nding algebraic correctness proofs for communication systems. It is described in the setting of CRL [11], which is, roughly, ACP [2, 3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in [4] and [10], but was not explicitly identi ed as such. Moreover, the protocols that were veri ed in these papers were rather complex, so that the general picture was obscured by the amount of details. In this paper, the proof strategy is materialised in the form of de nitions and theorems. These results reduce a large part of protocol veri cation to a number of trivial facts concerning data parameters occurring in implementation and speci cation. This greatly simpli es protocol veri cations and makes our approach amenable to mechanical assistance � experiments in this direction seem promising. The strategy is illustrated by several small examples and one larger example, the Concurrent Alternating Bit Protocol (CABP). Although simple, this protocol contains a large amount ofinternal parallelism, so that all relevant issuesmaketheir appearance.
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.
Process Algebra with Language Matching
, 1994
"... An axiom system ACP ø lm is presented as a variant of the process algebra ACP (Algebra of Communicating Processes). The acronym ACP ø lm stands for ACP with abstraction, extended with operators and axioms for language matching . Language matching is a technique based on trace information for lab ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
An axiom system ACP ø lm is presented as a variant of the process algebra ACP (Algebra of Communicating Processes). The acronym ACP ø lm stands for ACP with abstraction, extended with operators and axioms for language matching . Language matching is a technique based on trace information for labelling and cutting off process terms that do not match some given trace (or set of traces). It is shown that in combination with the axioms for action alphabets interesting results are derivable, the most important of which is the Redundancy Theorem 3.3.6, which roughly states that if no trace labels occur in the expression @H (p l k q), where p l is a labelled version of some process p, then it holds that @H (p l k q) = @H (p k q). It is shown that under certain natural conditions a similar result holds when abstraction is applied to p l and p, respectively. As an example the Concurrent Alternating Bit Protocol (CABP) is verified. The CABP is a simple communication protocol, which can be re...
On generating synchronous interworkings from PSF process traces
, 1993
"... ion from these actions can lead via traces to interworkings that allow an interleaving of actions not found in any trace of P (this is examplified in example 3.10 below). Suppose I is a subset of the set of all atomic actions A. Let s' be the specification we get from s by taking t I (P) as the top ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ion from these actions can lead via traces to interworkings that allow an interleaving of actions not found in any trace of P (this is examplified in example 3.10 below). Suppose I is a subset of the set of all atomic actions A. Let s' be the specification we get from s by taking t I (P) as the topprocess. We say s' is type 2 restricted with respect to E and j if I Ç Im E,j (g) = Æ. 2.7.1 Remark 1. Given type 1 restricted specification s, and given Ppartition E and bijection j: E ® N for s. If in s no abstraction is used, this comes down to taking the abstraction set of the abstraction operator t equal to the empty set. So, s can be said to be type 2 restricted with respect to E and j. 2. In the following we will drop the `with respect to E ...' part when introducing a type 2 restricted specification; E and j are clear from the context or irrelevant for the discussion at hand. We will even go one step further and use `restricted specification' to denote type 1 and type 2 restricte...