Tutorial on separation results in process calculi via leader election problems

Maria Grazia Vigliotti; Iain Phillips; Catuscia Palamidessi

doi:10.1016/j.tcs.2007.09.001

Tutorial on separation results in process calculi via leader election problems

Maria Grazia Vigliotti
, Iain Phillips
, Catuscia Palamidessi

Department of Computing
Imperial College London
INRIA-Futurs and Xyleme

Research output: Contribution to journal › Article › peer-review

18 Citations (Scopus)

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, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient Calculus and Boxed Ambients). We provide a unified approach for all these calculi using reduction semantics.

Original language	English
Pages (from-to)	267-289
Number of pages	23
Journal	Theoretical Computer Science
Volume	388
Issue number	1-3
DOIs	https://doi.org/10.1016/j.tcs.2007.09.001
Publication status	Published - 5 Dec 2007

Keywords

CCS
Leader election
Mobile ambients
π-calculus

Access to Document

10.1016/j.tcs.2007.09.001

Cite this

@article{950d305cb29444b4bff332f0e046a6bc,

title = "Tutorial on separation results in process calculi via leader election problems",

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, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient Calculus and Boxed Ambients). We provide a unified approach for all these calculi using reduction semantics.",

keywords = "CCS, Leader election, Mobile ambients, π-calculus",

author = "Vigliotti, \{Maria Grazia\} and Iain Phillips and Catuscia Palamidessi",

year = "2007",

month = dec,

day = "5",

doi = "10.1016/j.tcs.2007.09.001",

language = "English",

volume = "388",

pages = "267--289",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Tutorial on separation results in process calculi via leader election problems

AU - Vigliotti, Maria Grazia

AU - Phillips, Iain

AU - Palamidessi, Catuscia

PY - 2007/12/5

Y1 - 2007/12/5

N2 - 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, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient Calculus and Boxed Ambients). We provide a unified approach for all these calculi using reduction semantics.

AB - 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, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient Calculus and Boxed Ambients). We provide a unified approach for all these calculi using reduction semantics.

KW - CCS

KW - Leader election

KW - Mobile ambients

KW - π-calculus

U2 - 10.1016/j.tcs.2007.09.001

DO - 10.1016/j.tcs.2007.09.001

M3 - Article

AN - SCOPUS:35748973864

SN - 0304-3975

VL - 388

SP - 267

EP - 289

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

Tutorial on separation results in process calculi via leader election problems

Abstract

Keywords

Access to Document

Fingerprint

Cite this