scholarly journals Separation Results Via Leader Election Problems

2006 ◽  
pp. 172-194 ◽  
Author(s):  
Maria Grazia Vigliotti ◽  
Iain Phillips ◽  
Catuscia Palamidessi
Keyword(s):  
Leader Election ◽  
Separation Results

scholarly journals Tutorial on separation results in process calculi via leader election problems

2007 ◽  
Vol 388 (1-3) ◽  
pp. 267-289 ◽  
Author(s):  
Maria Grazia Vigliotti ◽  
Iain Phillips ◽  
Catuscia Palamidessi
Keyword(s):  
Leader Election ◽  
Process Calculi ◽  
Separation Results

scholarly journals An expressiveness study of priority in process calculi

2009 ◽  
Vol 19 (6) ◽  
pp. 1161-1189 ◽  
Author(s):  
CRISTIAN VERSARI ◽  
NADIA BUSI ◽  
ROBERTO GORRIERI
Keyword(s):  
Distributed Computing ◽  
Premature Termination ◽  
Expressive Power ◽  
Leader Election ◽  
Process Algebras ◽  
Process Calculi ◽  
Global Priority ◽  
Π Calculus ◽  
Computational Systems ◽  
Separation Results

Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms. In particular, we consider a finite (that is, recursion-free) fragment of asynchronous CCS with global priority (FAP, for short) and Phillips' CPG (CCS with local priority), and contrast their expressive power with that of two non-prioritised calculi, namely the π-calculus and its broadcast-based version, called bπ. We prove, by means of leader-election-based separation results, that, under certain conditions, there exists no encoding of FAP in π-Calculus or CPG. Moreover, we single out another problem in distributed computing, which we call the last man standing problem (LMS for short), that better reveals the gap between the two prioritised calculi above and the two non-prioritised ones, by proving that there exists no parallel-preserving encoding of the prioritised calculi in the non-prioritised calculi retaining any sincere (complete but partially correct, that is, admitting divergence or premature termination) semantics.

scholarly journals Time-Optimal Self-Stabilizing Leader Election in Population Protocols

2021 ◽  
Author(s):  
Janna Burman ◽  
Ho-Lin Chen ◽  
Hsueh-Ping Chen ◽  
David Doty ◽  
Thomas Nowak ◽  
...  
Keyword(s):  
Leader Election ◽  
Population Protocols ◽  
Time Optimal

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

2021 ◽  
Vol 68 (1) ◽  
pp. 1-21
Author(s):  
Leszek Gąsieniec ◽  
Grzegorz Stachowiak
Keyword(s):  
Leader Election ◽  
Population Protocols

Simple and fast approximate counting and leader election in populations

2021 ◽  
pp. 104698
Author(s):  
Othon Michail ◽  
Paul G. Spirakis ◽  
Michail Theofilatos
Keyword(s):  
Leader Election ◽  
Approximate Counting
Sign in / Sign up

Export Citation Format

Share Document