Results 1 
8 of
8
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...
ProofChecking Protocols using Bisimulations
 IN PROC. CONCUR’99, LNCS 1664
, 1999
"... We report on our experience in using the Isabelle/HOL theorem prover to mechanize proofs of observation equivalence for systems with infinitely many states, and for parameterized systems. We follow the direct approach: An infinite relation containing the pair of systems to be shown equivalent is def ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We report on our experience in using the Isabelle/HOL theorem prover to mechanize proofs of observation equivalence for systems with infinitely many states, and for parameterized systems. We follow the direct approach: An infinite relation containing the pair of systems to be shown equivalent is defined, and then proved to be a weak bisimulation. The weak bisimilarity proof is split into many cases, corresponding to the derivatives of the pairs in the relation. Isabelle/HOL automatically proves simple cases, and guarantees that no case is forgotten. The strengths and weaknesses of the approach are discussed.
On automating process algebra proofs
 Proceedings of the 11th International Symposium on Computer and Information Sciences, ISCIS XI
, 1996
"... In [10] Groote and Springintveld incorporated several modeloriented techniques { such asinvariants, matching criteria, state mappings { in the processalgebraic framework of CRL for structuring and simplifying protocol veri cations. In this paper, we formalise these extensions in Coq, which is a pr ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
In [10] Groote and Springintveld incorporated several modeloriented techniques { such asinvariants, matching criteria, state mappings { in the processalgebraic framework of CRL for structuring and simplifying protocol veri cations. In this paper, we formalise these extensions in Coq, which is a proof development tool based on type theory. In the updated framework, the length of proof constructions is reduced significantly. Moreover, the new approach allows for more automation (proof generation) than was possible in the past. The results are illustrated by an example in which we prove two queue representations equal. 1
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 3 (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...
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
(Show Context)
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.
EFFECTIVE CHEMISTRY FOR SYNCHRONY AND ASYNCHRONY
"... Abstract We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose operational effectiveness criteria in the form of confluence, coherence and standardization properties on an orie ..."
Abstract
 Add to MetaCart
Abstract We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose operational effectiveness criteria in the form of confluence, coherence and standardization properties on an oriented version of the structural laws. We revisit Berry and Boudol’s Chemical Abstract Machine (Cham) framework using operational effectiveness criteria. We illustrate our ideas with a new formulation of a Cham for Tccs with external choice, one which is operationally effective unlike previous Cham formulations, and demonstrate that the new Cham is fully abstract with respect to the LTS semantics for Tccs. We then show how this approach extends to the synchronous calculus Sccs, for which a Cham had hitherto not been proposed. 1.