A Process Algebra Based on LINDA

The problem of comparing and analyzing the relationships between distributed programs written in the same concurrent programming language is addressed. It arises each time one wants to establish program correctness with respect to a notion of “being an approximation of”. We define a testing scenario for PAL, a process algebra which is obtained by embedding the Linda primitives for interprocess communication in a CSP like process description language. We present a proof system for PAL processes which is sound and complete with respect to the behavioural relation and illustrate how it works by giving a small example.

[1]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[2]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[3]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[4]  Rocco De Nicola,et al.  An Observational Semantics for Linda , 1995, STRICT.

[5]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[6]  Anna Ingólfsdóttir,et al.  A Theory of Communicating Processes with Value Passing , 1993, Inf. Comput..

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[9]  Rocco De Nicola,et al.  Testing Equivalence for Processes , 1983, ICALP.

[10]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[11]  Rocco De Nicola,et al.  CCS without tau's , 1987, TAPSOFT, Vol.1.

[12]  Nicholas Carriero,et al.  Distributed data structures in Linda , 1986, POPL '86.

[13]  Josva Kleist,et al.  Bisimulations for Asynchronous Mobile Processes , 1995 .

[14]  Luca Aceto,et al.  A Theory of Testing for ACP , 1991, CONCUR.

[15]  Jifeng He,et al.  A Theory of Synchrony and Asynchrony , 1990, Programming Concepts and Methods.

[16]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[17]  Jan A. Bergstra,et al.  Process Algebra with Asynchronous Communication Mechanisms , 1984, Seminar on Concurrency.

[18]  Nicholas Carriero,et al.  Linda in context , 1989, CACM.

[19]  Frank S. de Boer,et al.  On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences , 1990, CONCUR.

[20]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[21]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[22]  Frank S. de Boer,et al.  Asynchronous communication in process algebra , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.