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

DOI10.1007/BF02737102zbMath0621.68011OpenAlexW4250454201MaRDI QIDQ1090104

Luc Bougé

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02737102

zbMATH Keywords

CSPnetwork topologydistributed programming languagesnetworks of processessemantic notion of symmetry

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Theory of operating systems (68N25)

Related Items (20)

Contextual equivalences in configuration structures and reversibility ⋮ On the structural simplicity of machines and languages ⋮ Theory of interaction ⋮ Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms ⋮ Symmetry breaking in distributed networks ⋮ Hundreds of impossibility results for distributed computing ⋮ Election and rendezvous with incomparable labels ⋮ Tutorial on separation results in process calculi via leader election problems ⋮ CCS with priority guards ⋮ Distributed disassembly of mosaics ⋮ Symmetric electoral systems for ambient calculi ⋮ Symmetric and Asymmetric Asynchronous Interaction ⋮ Enabling synchronous and asynchronous communications in CSP for SOC ⋮ Leader election in rings of ambient processes ⋮ On Synchronous and Asynchronous Interaction in Distributed Systems ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP ⋮ An expressiveness study of priority in process calculi ⋮ What is a ``good encoding of guarded choice? ⋮ A contribution to the theory of program testing

Cites Work

• How processes learn
• Appraising fairness in languages for distributed programming
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• A distributed solution of the distributed termination problem
• Modeling the distributed termination convention of CSP
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• Distributed Termination
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes