Solos in concert

  • Authors:

  • Cosimo Laneve;Björn Victor

  • Affiliations:

  • Department of Computer Science, University of Bologna, Italy Email: laneve@CS.UniBO.IT;Department of Information Technology, Uppsala University, Sweden Email: Bjorn.Victor@it.uu.se

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a calculus of mobile processes without prefix or summation, called the solos calculus. Using two different encodings, we show that the solos calculus can express both action prefix and guarded summation. One encoding gives a strong correspondence, but uses a match operator; the other yields a slightly weaker correspondence, but uses no additional operators. We also show that the expressive power of the solos calculus is still retained by the sub-calculus where actions carry at most two names. On the other hand, expressiveness is lost in the solos calculus without match and with actions carrying at most one name.