eprintid: 337
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/37
datestamp: 2011-06-09 09:24:10
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-09 09:24:10
type: article
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: Linda-based applicative and imperative process algebras
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Concurrency; Asynchronous communications; Process algebras; Formal semantics
abstract: The classical algebraic approach to the specification and verification of concurrent systems is tuned to distributed programs that rely on asynchronous communications and permit explicit data exchange. An applicative process algebra, obtained by embedding the Linda primitives for interprocess communication in a CCS/CSP-like language, and an imperative one, obtained from the applicative variant by adding a construct for explicit assignment of values to variables, are introduced. The testing framework is used to define behavioural equivalences for both languages and sound and complete proof systems for them are described together with a fully abstract denotational model (namely, a variant of Strong Acceptance Trees).
date: 2000
date_type: published
publication: Theoretical Computer Science
volume: 238
number: 1-2
publisher: Elsevier
pagerange: 389-437
id_number: 10.1016/S0304-3975(99)00339-4
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/S0304397599003394
citation:   De Nicola, Rocco and Pugliese, Rosario  Linda-based applicative and imperative process algebras.  Theoretical Computer Science, 238 (1-2).  pp. 389-437.  ISSN 0304-3975      (2000)