TY  - CHAP
TI  - A Process Algebra Based on LINDA
AV  - none
UR  - http://dx.doi.org/10.1007/3-540-61052-9_45
SN  - 3-540-61052-9
N2  - 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.
M1  - 1061
ID  - eprints356
EP  - 178
T2  - Coordination Languages and Models (COORDINATION 1996)
Y1  - 1996///
PB  - Springer
A1  - De Nicola, Rocco
A1  - Pugliese, Rosario
T3  - Lecture Notes in Computer Science
SP  - 160
ED  - Ciancarini, Paolo
ED  - Hankin, Chris
ER  -