eprintid: 356
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/56
datestamp: 2011-06-14 10:53:56
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-14 10:53:56
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Pugliese, Rosario
creators_id: r.denicola@imtlucca.it
creators_id: 
title: A Process Algebra Based on LINDA
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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.
date: 1996
date_type: published
series: Lecture Notes in Computer Science
volume: 1061
publisher: Springer
pagerange: 160-178
id_number: 10.1007/3-540-61052-9_45
refereed: TRUE
isbn: 3-540-61052-9
book_title: Coordination Languages and Models (COORDINATION 1996)
editors_name: Ciancarini, Paolo
editors_name: Hankin, Chris
official_url: http://dx.doi.org/10.1007/3-540-61052-9_45
funders: Work partially supported by EEC within the HCM Project EXPRESS, and by CNR within the project "Specifica ad Alto Livello e Verifica di Sistemi Digitali".
citation:   De Nicola, Rocco and Pugliese, Rosario  A Process Algebra Based on LINDA.   In:  Coordination Languages and Models (COORDINATION 1996).   Lecture Notes in Computer Science, 1061 .  Springer, pp. 160-178.  ISBN 3-540-61052-9      (1996)