Symmetric and synchronous communication in peer-to-peer networks
| Authors | |
|---|---|
| Publication date | 2008 |
| Host editors |
|
| Book title | Mathematics of Program Construction |
| Book subtitle | 9th International Conference, MPC 2008, Marseille, France, July 15-18, 2008 : proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | 9th International Conference on Mathematics of Program Construction (MPC 2008), Marseille, France |
| Pages (from-to) | 404-421 |
| Publisher | Berlin: Springer |
| Organisations |
|
| Abstract |
Motivated by distributed implementations of game-theoretical algorithms, we study symmetric process systems and the problem of attaining common knowledge between processes. We formalize our setting by defining a notion of peer-to-peer networks and appropriate symmetry concepts in the context of Communicating Sequential Processes (CSP) [1]. We then prove that CSP with input and output guards makes common knowledge in symmetric peer-to-peer networks possible, but not the restricted version which disallows output statements in guards and is commonly implemented. Our results extend [2].
An extended version is available at http://arxiv.org/abs/0710.2284. |
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1007/978-3-540-70594-9_21 |
| Permalink to this page | |