Logo eprints

Linda-based applicative and imperative process algebras

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)

Full text not available from this repository.


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).

Item Type: Article
Identification Number: 10.1016/S0304-3975(99)00339-4
Uncontrolled Keywords: Concurrency; Asynchronous communications; Process algebras; Formal semantics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Rocco De Nicola
Date Deposited: 09 Jun 2011 09:24
Last Modified: 11 Jul 2011 14:36
URI: http://eprints.imtlucca.it/id/eprint/337

Actions (login required)

Edit Item Edit Item