%X 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.
%E Paolo Ciancarini
%E Chris Hankin
%L eprints356
%D 1996
%A Rocco De Nicola
%A Rosario Pugliese
%S Lecture Notes in Computer Science
%R 10.1007/3-540-61052-9_45
%B Coordination Languages and Models (COORDINATION 1996)
%T A Process Algebra Based on LINDA
%P 160-178
%V 1061
%I Springer