Computing Publications

Publications Home » Leader Election in Rings of Ambie...

Leader Election in Rings of Ambient Processes

Iain Phillips, Maria Vigliotti

Conference or Workshop Paper
11th International Workshop on Expressiveness in Concurrency (EXPRESS'04), 30 August, 2004, London, Great Britain
Electronic Notes in Theoretical Computer Science
Volume 128
Issue 2
April, 2005
DOI 10.1016/j.entcs.2004.11.036

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.

BibTEX file for the publication built & maintained by Ashok Argent-Katwala.