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

Bougé, Luc

doi:10.1007/bf02737102

Cited by 19 publications

(67 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its formalisation is attributed to Le Lann in Le Lann (1977), where the leader election preceded the generation of a new token in a ring network after the loss of the previous one. This problem was considered for the first time in a process algebra framework in Bougé (1988), where it was used to study the expressive power of CSP (Hoare 1985) in relation to its communication primitives and the topology of the network. The first application of the leader election problem to the π-Calculus revealed the superior expressiveness of mixed-choice compared with separate choice (Palamidessi 1997;2003): the relative expressive power of the two constructs is stated in terms of the impossibility of a reasonable encoding of mixed into separate choice, where the reasonableness is represented by the uniformity (preservation of the parallelism and symmetry of the system) of the encoding function and the preservation of the observable actions performed by the encoded processes.…”

Section: Related Workmentioning

confidence: 99%

An expressiveness study of priority in process calculi

Versari

Busi

Gorrieri

2009

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

In memory of Nadia BusiPriority 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.

show abstract

Section: Related Workmentioning

confidence: 99%

An expressiveness study of priority in process calculi

Versari

Busi

Gorrieri

2009

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

show abstract

“…Symmetry means informally that all the processes in the network can perform the same actions up to some kind of renaming. This kind of problem is widely studied in the literature of distributed computing [14,2] and process algebra [1,4,9,18]. Problems are categorised by the topology of the network and the way in which the winner is declared.…”

Section: Electoral Systemsmentioning

confidence: 99%

“…The third item requires some comment. Bougé [4] defined an encoding as "reasonable" if it maps electoral systems to electoral systems. The condition of respecting observations is our interpretation of Palamidessi's requirement of "preserving a reasonable semantics".…”

Section: Definition 8 Let L L Be Process Languages An Encodingmentioning

confidence: 99%

Electoral Systems in Ambient Calculi

Phillips

Vigliotti

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calculus of Mobile Ambients (MA). Zimmer has shown that the synchronous pi-calculus without choice can be encoded in pure (no communication) Safe Ambients. We show that pure MA without restriction has symmetric electoral systems, that is, it is possible to solve the problem of electing a leader in a symmetric network. By the work of Palamidessi, this implies that pure MA without restriction is not encodable (under certain conditions) in the picalculus with separate choice. We adapt the work of Carbone and Maffeis to show that pure MA cannot be encoded (under certain other conditions) into the pi-calculus with mixed choice (but without matching).

show abstract

“…The protocol solves the election problem (see, e.g. (Bouge, 1988» for all unambiguous graphs (it chooses a leader-node and any node can be chosen as a leader).…”

Section: Mazurkiewicz Algorithm and Its Implementation By Amentioning

confidence: 99%

Enumeration protocol in Estelle: an exercise in stepwise development

Dembinski

1998

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

The paper sketches a design process that starts with a mathematical solution of the enumeration problem and ends up with a distributed, efficient, and successfully terminating protocol in the specification language Estelle. The subsequent versions of the protocol are obtained from their predecessors by well controlled and small modifications that (almost) obviously preserve correctness. The target, successful (successful with arbitrarily high probability) solution allows forgetting theoretical "impossibility results", which prove nonexistence of such successful distributed solutions for some classes of networks.

show abstract

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

Cited by 19 publications

References 24 publications

An expressiveness study of priority in process calculi

An expressiveness study of priority in process calculi

Electoral Systems in Ambient Calculi

Enumeration protocol in Estelle: an exercise in stepwise development

Contact Info

Product

Resources

About