Computing Publications

Publications Home » Separation Results via Leader Ele...

Separation Results via Leader Election Problems

Maria Vigliotti, Iain Phillips, Catuscia Palamidessi

Tutorial
4th International Symposium on Formal Methods for Objects and Components (FMCO 2005), 1-4 November 2005, CWI, Amsterdam, The Netherlands
September, 2006
Lecture Notes in Computer Science
Volume 4111
pp.172–194
Springer-Verlag
DOI 10.1007/11804192_9
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 pi-calculus with mixed choice and with separate choice, value-passing CCS and Mobile Ambients. We provide a unified approach for all these calculi using reduction semantics.

Keywords
AESOP
 

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