Hostname: page-component-6bf8c574d5-gr6zb Total loading time: 0 Render date: 2025-02-21T04:05:03.994Z 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
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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