On the Expressive Power of KLAIM-based Calculi


pagemagnifierBibTeX_logo.pngmagnifierpage_white_acrobatmagnifier

Rocco De Nicola, Daniele Gorla, Rosario Pugliese

Theoretical Computer Science 356(3), pages 387-421
May 2006

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 pi-calculus.

(keywords) Bisimulation

Publication

— authors

Rocco De Nicola, Daniele Gorla, Rosario Pugliese

— status

published

— sort

article in journal

— publication date

May 2006

— journal

Theoretical Computer Science

— volume

356

— issue

3

— pages

387-421

URLs

original page

identifiers

— DOI

10.1016/j.tcs.2006.02.007

— print ISSN

0304-3975

Partita IVA: 01131710376 — Copyright © 2008–2023 APICe@DISI – PRIVACY