On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
type: Item
instance of: scholarly article
title: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
zbMATH Open document ID: 0621.68011
DOI: 10.1007/BF02737102
author: Luc Bougé
published in: Acta Informatica
publication date: 1988-01-01T00:00:00Z
review text: We define a semantic notion of symmetry well-suited for networks of processes specified in Hoare's language CSP. Symmetric algorithms to find a leader in such networks are then studied. We show that the existence of such algorithms depends crucially on the network topology and on the use of input/output guards in processes. The election problem appears thus as a powerful criterion in assessing the expressive power of distributed programming languages like CSP.
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 4007705
zbMATH Keywords: semantic notion of symmetry
zbMATH Keywords: networks of processes
zbMATH Keywords: CSP
zbMATH Keywords: network topology
zbMATH Keywords: distributed programming languages
MaRDI profile type: Publication
cites work: Modeling the distributed termination convention of CSP
cites work: Appraising fairness in languages for distributed programming
cites work: Q3681912
cites work: An Effective Implementation for the Generalized Input-Output Construct of CSP
cites work: Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
cites work: Q3787467
cites work: How processes learn
cites work: Q3681916
cites work: Q3929024
cites work: Distributed Termination
cites work: Communicating sequential processes
cites work: A distributed solution of the distributed termination problem
cites work: Q3677158
full work available at URL: https://doi.org/10.1007/bf02737102
OpenAlex ID: W4250454201
description: scientific article; zbMATH DE number 4007705