eprintid: 299
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/02/99
datestamp: 2011-05-24 10:30:56
lastmod: 2011-07-11 14:36:25
status_changed: 2011-05-24 10:30:56
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Gorla, Daniele
creators_name: Pugliese, Rosario
creators_id: r.denicola@imtlucca.it
creators_id: 
creators_id: 
title: On the expressive power of KLAIM-based calculi
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Process calculi; Network-aware programming; Expressiveness; Language encodings; Behavioural equivalences; Bisimulation
note: Issue title: Expressiveness in Concurrency.
This work is the full version of http://eprints.imtlucca.it/311/.
abstract: We study the expressive power of variants of KLAIM, an experimental language with programming primitives for network-aware programming that combines the process algebra approach with the coordination-oriented one. KLAIM has proved to be suitable for programming a wide range of distributed applications with agents and code mobility, and has been implemented on the top of a runtime system written in Java. In this paper, the expressivity of its constructs is tested by distilling from it a few, more and more foundational, languages and by studying the encoding of each of them into a simpler one. The expressive power of the considered calculi is finally tested by comparing one of them with asynchronous π-calculus.
date: 2006
date_type: published
publication: Theoretical Computer Science
volume: 356
number: 3
publisher: Elsevier
pagerange: 387-421
id_number: 10.1016/j.tcs.2006.02.007
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/S0304397506001484
related_url_url: http://eprints.imtlucca.it/311/
citation:   De Nicola, Rocco and Gorla, Daniele and Pugliese, Rosario  On the expressive power of KLAIM-based calculi.  Theoretical Computer Science, 356 (3).  pp. 387-421.  ISSN 0304-3975      (2006)