On the Expressive Power of KLAIM-based Calculi

Last modified by Andrea Omicini on 2020/10/12 16:53

Rocco De Nicola, Daniele Gorla, Rosario Pugliese

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
Theoretical Computer Science 356(3), pages 387-421, May 2006, IEEE Computer Society
11th International Workshop on Expressiveness in Concurrency (EXPRESS'04)
	Author = {De Nicola, Rocco and Gorla, Daniele and Pugliese, Rosario},
	Doi = {10.1016/j.tcs.2006.02.007},
	Issn = {0304-3975},
	Journal = {Theoretical Computer Science},
	Keywords = {Bisimulation},
	Note = {11th International Workshop on Expressiveness in Concurrency (EXPRESS'04)},
	Number = 3,
	Pages = {387--421},
	Title = {On the Expressive Power of {KLAIM}-based Calculi},
	Url = {http://www.sciencedirect.com/science/article/pii/S0304397506001484},
	Volume = 356,
	Year = 2006}

2011 © aliCE Research Group @ DEIS, Alma Mater Studiorum-Università di Bologna