Leader election in rings of ambient processes

Authors:
Iain Phillips;Maria Grazia Vigliotti
Affiliations:
Department of Computing, Imperial College London, London, England;Department of Computing, Imperial College London, London, England
Venue:
Theoretical Computer Science - Expressiveness in concurrency
Year:
2006

Citing 16
Cited 9

Communicating sequential processes

Communicating sequential processes
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes

Acta Informatica
Communication and concurrency

Communication and concurrency
A calculus of mobile processes, I

Information and Computation
&pgr;-calculus, internal mobility, and agent-passing calculi

TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
On Reduction Semantics for the Push and Pull Ambitent Calculus

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Access control for mobile agents: The calculus of boxed ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi

Mathematical Structures in Computer Science
On the expressiveness of pure safe ambients

Mathematical Structures in Computer Science
On the computational strength of pure ambient calculi

Theoretical Computer Science - Expressiveness in concurrency
A bisimulation-based semantic theory of Safe Ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
When ambients cannot be opened

Theoretical Computer Science - Foundations of software science and computation structures

Tutorial on separation results in process calculi via leader election problems

Theoretical Computer Science
Symmetric electoral systems for ambient calculi

Information and Computation
Matching Systems for Concurrent Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Unified Approach to Encodability and Separation Results for Process Calculi

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Relative Expressive Power of Ambient-Based Calculi

Trustworthy Global Computing
On the Relative Expressive Power of Calculi for Mobility

Electronic Notes in Theoretical Computer Science (ENTCS)
On the expressiveness of interaction

Theoretical Computer Science
Towards a unified approach to encodability and separation results for process calculi

Information and Computation
Separation results via leader election problems

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects

Quantified Score

Hi-index	0.00

Visualization

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.