On the Expressive Power of KLAIM-based Calculi

Rocco De Nicola, Daniele Gorla and Rosario Pugliese

Short version in 11th International Workshop on Expressiveness in Concurrency (EXPRESS '04), London (UK), August 30, 2004.
Full version in Theoretical Computer Science.
Formerly available as Tech. Rep. 09/2004, Dip. Informatica, Univ di Roma "La Sapienza".


Abstract:

In this work, we study the expressive power of variants of KLAIM, an experimental language with programming primitives for global computing 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 based on Java. The expressivity of its constructs is tested by distilling from it some (more and more foundational) calculi and studying the encoding of each of the considered languages into a simpler one. An encoding of asynchronous pi-calculus into one of these calculi is also presented.


@InProceedings{DGP:EXPRESS04,
  author    =   {R. {De Nicola} and D. Gorla and R. Pugliese},
  title     =   {On the Expressive Power of KLAIM-based Calculi},
  editor    =   {F. Corradini and J. Baeten},
  booktitle =   {Proc. of 11th International Workshop on Expressiveness in Concurrency (EXPRESS'04)},
  series    =   {ENTCS},
  volume    =  	{128},
  number    =  	{2},
  pages     =  	{117--130},
  year      =  	{2004},
  publisher =   {Elsevier},
}

@Article{DGP:TCS06,
  author    =  	{R. {De Nicola} and D. Gorla and R. Pugliese},
  title     =  	{On the Expressive Power of KLAIM-based Calculi},
  journal   =   {Theoretical Computer Science},
  volume    =   {356},
  number    = 	{3},
  pages     =  	{387--421},
  year      =  	{2006},
  publisher =   {Elsevier},
}

Home page / Publications