On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes (Q1090104)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes |
scientific article; zbMATH DE number 4007705
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes |
scientific article; zbMATH DE number 4007705 |
Statements
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes (English)
0 references
1988
0 references
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.
0 references
semantic notion of symmetry
0 references
networks of processes
0 references
CSP
0 references
network topology
0 references
distributed programming languages
0 references
0 references
