Computing Publications

Publications Home » Leader election in rings of ambie...

Leader election in rings of ambient processes

Iain Phillips, Maria Vigliotti

Journal Article
Theoretical Computer Science
Volume 356
Issue 3
pp.468–494
2006
Elsevier
DOI 10.1016/j.tcs.2006.02.004
Abstract

Palamidessi has shown that the pi-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi's methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also show that the calculus of Boxed Ambients is more expressive than its communication-free fragment.

Keywords
AESOP
BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.