Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.9
URN: urn:nbn:de:0030-drops-128217
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12821/
Balasubramanian, A. R. ; Walukiewicz, Igor
Characterizing Consensus in the Heard-Of Model
| pdf-format: |
|
Abstract
The Heard-Of model is a simple and relatively expressive model of distributed computation. Because of this, it has gained a considerable attention of the verification community. We give a characterization of all algorithms solving consensus in a fragment of this model. The fragment is big enough to cover many prominent consensus algorithms. The characterization is purely syntactic: it is expressed in terms of some conditions on the text of the algorithm.
BibTeX - Entry
@InProceedings{balasubramanian_et_al:LIPIcs:2020:12821,
author = {A. R. Balasubramanian and Igor Walukiewicz},
title = {{Characterizing Consensus in the Heard-Of Model}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Igor Konnov and Laura Kov{\'a}cs},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12821},
URN = {urn:nbn:de:0030-drops-128217},
doi = {10.4230/LIPIcs.CONCUR.2020.9},
annote = {Keywords: consensus problem, Heard-Of model, verification}
}
| Keywords: | consensus problem, Heard-Of model, verification | |
| Seminar: | 31st International Conference on Concurrency Theory (CONCUR 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 26.08.2020 |
