Leader election in rings of ambient processes
File(s)DTR04-10.pdf (361.48 KB)
Published version
Author(s)
Phillips, Iain
Vigliotti, Maria Grazia
Type
Report
Abstract
Palamidessi has shown that the ¼-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.
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.
Date Issued
2004-01-01
Citation
Departmental Technical Report: 04/10, 2004, pp.1-40
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
40
Journal / Book Title
Departmental Technical Report: 04/10
Copyright Statement
© 2004 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Publication Status
Published
Article Number
04/10