Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-05-25T12:50:50.053Z Has data issue: false hasContentIssue false

Solos in concert

Published online by Cambridge University Press:  16 October 2003

COSIMO LANEVE
Affiliation:
Department of Computer Science, University of Bologna, Italy Email: laneve@CS.UniBO.IT
BJÖRN VICTOR
Affiliation:
Department of Information Technology, Uppsala University, Sweden Email: Bjorn.Victor@it.uu.se

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.

Type
Paper
Copyright
2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)