%R 10.1016/j.tcs.2006.02.007
%T On the expressive power of KLAIM-based calculi
%P 387-421
%J Theoretical Computer Science
%V 356
%O Issue title: Expressiveness in Concurrency.
This work is the full version of http://eprints.imtlucca.it/311/.
%N 3
%A Rocco De Nicola
%A Daniele Gorla
%A Rosario Pugliese
%D 2006
%L eprints299
%X 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.
%K Process calculi; Network-aware programming; Expressiveness; Language encodings; Behavioural equivalences; Bisimulation
%I Elsevier