Separation Results Via Leader Election Problems

13 years 10 months ago

Download www.lix.polytechnique.fr

Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixed choice and with separate choice, value-passing CCS and Mobile Ambients. We provide a uniﬁed approach for all these calculi using reduction semantics.

Maria Grazia Vigliotti, Iain Phillips, Catuscia Pa

Real-time Traffic

Expressive Power | FMCO 2005 | Process Calculi | Symmetric Network |

claim paper

» Robust Stabilizing Leader Election

» Propagation and Leader Election in a Multihop Broadcast Environment

» A Probabilistically Correct Leader Election Protocol for Large Groups

» Memory Space Requirements for SelfStabilizing Leader Election Protocols

» A gametheoretic intrusion detection model for mobile ad hoc networks

» Towards Secure and Scalable Computation in PeertoPeer Networks

» Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems

» The QueueRead QueueWrite PRAM Model Accounting for Contention in Parallel Algorithms

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FMCO
Authors	Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi

Comments (0)

Sciweavers

Separation Results Via Leader Election Problems

Expressive Power | FMCO 2005 | Process Calculi | Symmetric Network |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers