Results 1  10
of
14
Algebraic Process Verification
 Handbook of Process Algebra, chapter 17
"... This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. ..."
Abstract

Cited by 75 (16 self)
 Add to MetaCart
This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras.
A Bounded Retransmission Protocol for Large Data Packets. A Case Study in Computer Checked Algebraic Verification
"... This note describes a protocol for the transmission of data packets that are too large to be transferred in their entirety. Therefore, the protocol splits the data packets and broadcasts it in parts. It is assumed that in case of failure of transmission through data channels, only a limited number o ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
This note describes a protocol for the transmission of data packets that are too large to be transferred in their entirety. Therefore, the protocol splits the data packets and broadcasts it in parts. It is assumed that in case of failure of transmission through data channels, only a limited number of retries are allowed (bounded retransmission). If repeated failure occurs, the protocol stops trying and the sending and receiving protocol users are informed accordingly. The protocol and its external behaviour are speci ed in CRL. The correspondence between these is shown using the axioms of CRL. The whole proof of this correspondence has been computer checked using the proof checker Coq. This provides an example showing that proof checking of realistic protocols is feasible within the setting of process algebras.
The Parallel Composition of Uniform Processes with Data
 Theoretical Computer Science
, 2001
"... A general basis for the definition of a finite but unbounded number of parallel processes is the equation S(n; dt) = P (0; get(0; dt))/ eq(n; 0) .(P (n; get(n; dt)) k S(n \Gamma 1; dt)). In this formula eq(n; 0) is an equality test, and get(n; dt) denotes the nth data element in table dt . We deri ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
A general basis for the definition of a finite but unbounded number of parallel processes is the equation S(n; dt) = P (0; get(0; dt))/ eq(n; 0) .(P (n; get(n; dt)) k S(n \Gamma 1; dt)). In this formula eq(n; 0) is an equality test, and get(n; dt) denotes the nth data element in table dt . We derive a linear process equation with the same behaviour as S(n; dt ), and show that this equation is welldefined, provided one adopts the principle CLRSP from [4]. In order to demonstrate the strength of our result, we use it for the analysis of a standard example. We show that n + 1 concatenated buffers form a queue of capacity n + 1. 1 Introduction Distributed algorithms are often configured as an arbitrarily large but finite set of processors that run a similar program. Using the formalism CRL (micro Common Representation Language [9]) this can be described, using recursion and operators for parallelism. Several benchmark verifications in CRL and process algebra are therefore based on the...
A Correctness Proof of the Bakery Protocol in µCRL
 ALGEBRA OF COMMUNICATING PROCESSES, WORKSHOPS IN COMPUTING
, 1994
"... A specification of a bakery protocol is given in µCRL. We provide a simple correctness criterion for the protocol. Then the protocol is proven correct using a proof system that has been developed for µCRL. The proof primarily consists of algebraic manipulations based on specifications of abstract d ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A specification of a bakery protocol is given in µCRL. We provide a simple correctness criterion for the protocol. Then the protocol is proven correct using a proof system that has been developed for µCRL. The proof primarily consists of algebraic manipulations based on specifications of abstract data types and elementary rules and axioms from process algebra.
Network Algebra for Asynchronous Dataflow
, 1997
"... Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory of networks, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic prop ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory of networks, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic properties of networks. For asynchronous dataflow networks, additional constants and axioms are given; and a corresponding process algebra model is introduced. This process algebra model is compared with previous models for asynchronous dataflow. Keywords & Phrases: dataflow networks, network algebra, process algebra, asynchronous dataflow, feedback, merge anomaly, history models, oracle based models, trace models. 1994 CR Categories: F.1.1, F.1.2, F.3.2., D.1.3., D.3.1. This paper is an abridged version of [1]. The full version covers synchronous dataflow networks as well. y Partially supported by ESPRIT BRA 8533 (NADA) and ESPRIT BRA 6454 (CONFER). x On leave (19961997) at Unit...
ProFun  a Language for Executable Specifications
 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP '96), volume 1140 of Lecture Notes in Computer Science
, 1996
"... . We present a new programming language ProFun which is aimed for the specification and prototype implementation of reactive systems. ProFun combines the paradigms of concurrent and functional programming. A formal operational semantics is developed as a basis for verification techniques. We hav ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
. We present a new programming language ProFun which is aimed for the specification and prototype implementation of reactive systems. ProFun combines the paradigms of concurrent and functional programming. A formal operational semantics is developed as a basis for verification techniques. We have implemented a ProFuncompiler which uses C++ as its target language. Keywords: Executable Specifications, Language Design, Integration of Concurrent and Functional Programming, Formal Reasoning. 1 Introduction Reactive and distributed systems are of increasing importance in theory and practice of computer science. Various languages for the specification and implementation of reactive systems have been developed to integrate two major aspects of reactive systems: the description of the structure and dynamic behaviour of a system and the handling of data. Process algebras [Mil89, Hoa85] are commonly used to specify the reactions of a system on external events from its environment by me...
The tree identify protocol of IEEE 1394
 PROCEEDINGS OF THE 3RD ERCIM INT. WORKSHOP ON FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS (AMSTERDAM, THE NETHERLANDS
, 1998
"... We specify the tree identify protocol of a high performance serial multimedia bus (IEEE standard 1394 [IEE95]) in three different levels of detail using µCRL [GP95]. We propose using the cones and foci verification technique of Groote and Springintveld [GS95] to show the descriptions equivalent unde ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We specify the tree identify protocol of a high performance serial multimedia bus (IEEE standard 1394 [IEE95]) in three different levels of detail using µCRL [GP95]. We propose using the cones and foci verification technique of Groote and Springintveld [GS95] to show the descriptions equivalent under branching bisimulation. The proof of the equivalence of the two more abstract specifications is shown in detail and the proof of the equivalence of the most abstract and the more complex description, which is work in progress, is sketched.
Network Algebra for Synchronous and Asynchronous Dataflow
"... Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis) of data ow networks. The core of this algebraic setting is provided by an equational theory called Basic Network Algebra (BNA). It constitutes a selection of primitives and identities from the algebr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Network algebra (NA) is proposed as a uniform algebraic framework for the description (and analysis) of data ow networks. The core of this algebraic setting is provided by an equational theory called Basic Network Algebra (BNA). It constitutes a selection of primitives and identities from the algebra of flownomials due to [Ste86] and [CaS88&89]. Both synchronous and asynchronous data ow networks are then investigated from the viewpoint of network algebra. To this end the NA primitives are defined such that the identities of BNA hold. These axioms are particularly strict about the role of the connections, which will be called flows of data. We describe three interpretations of the connections that satisfy the BNA identities: minimal stream delayers, stream delayers and stream retimers. Each of the above possibilities leads to a class of data ow networks: synchronous data ow networks, asynchronous data ow networks and fully asynchronous data ow networks, respectively. For each case stream transformer and process algebra models are introduced and compared.