Results 1 
3 of
3
Focus points and convergent process operators: A proof strategy for protocol verification
, 1995
"... We present a strategy for finding 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 [ ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
We present a strategy for finding 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 identified as such. Moreover, the protocols that were verified 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 definitions and theorems. These results reduce a large part of protocol verification to a number of trivial facts concerning data parameters occurring in implementation and specification. This greatly simplifies protocol verifications 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 of internal parallelism, so that all relevant issues make their appearance.
A Practical Approach to Implementing RealTime Semantics
 ANNALS OF SOFTWARE ENGINEERING
, 1999
"... This paper investigates implementations of process algebras which are suitable for modeling concurrent realtime systems. It suggests an approach for efficiently implementing realtime semantics using dynamic priorities. For this purpose a process algebra with dynamic priority is defined, whose sema ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper investigates implementations of process algebras which are suitable for modeling concurrent realtime systems. It suggests an approach for efficiently implementing realtime semantics using dynamic priorities. For this purpose a process algebra with dynamic priority is defined, whose semantics corresponds onetoone to traditional realtime semantics. The advantage of the dynamicpriority approach is that it drastically reduces the statespace sizes of the systems in question while preserving all properties of their functional and realtime behavior. The utility of the technique is demonstrated by a case study which deals with the formal modeling and verification of several aspects of the widelyused SCSI2 busprotocol. The case study is carried out in the Concurrency Workbench of North Carolina, an automated verification tool in which the process algebra with dynamic priority is implemented. It turns out that the state space of the busprotocol model is about an order of ...
Seminearring Models of Reversible Computation I
, 1997
"... Process Algebra is one of the wellknown algebraic models used in theoretical Computer Science, mappings of semigroups are another such model. Both are based upon an algebraic structure known as a seminearring. Reversible Computation is a paradigm of growing importance, adaptions to current too ..."
Abstract
 Add to MetaCart
Process Algebra is one of the wellknown algebraic models used in theoretical Computer Science, mappings of semigroups are another such model. Both are based upon an algebraic structure known as a seminearring. Reversible Computation is a paradigm of growing importance, adaptions to current tools are of interest in the light of new developments. The extra structure afforded to the algebraic structure as a result of the imposition of reversible computation requirements leads to a richer and more interesting theory. In this paper I want to report on my earliest investigation of the interplay between these algebraic models of computation and the ideas of reversible computation. I look at various ways in which we could encode the requirements of reversibility of computation into the seminearrings from the Process Algebra and semigroup mappings models of computation. Successive generalisations of the algebraic structure follow, with some surprising results about their equival...