@inproceedings{4a1238ac57bd4c07b510f75eb9b7d342,
title = "Agreement functions for distributed computing models",
abstract = "The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function determines the best level of set consensus these processes can reach. We show that the task computability of a large class of fair adversaries that includes, in particular superset-closed and symmetric one, is precisely captured by agreement functions.",
author = "Petr Kuznetsov and Thibault Rieutord",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 5th International Conference on Networked Systems, NETYS 2017 ; Conference date: 17-05-2017 Through 19-05-2017",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-59647-1\_14",
language = "English",
isbn = "9783319596464",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "175--190",
editor = "\{El Abbadi\}, Amr and Benoit Garbinato",
booktitle = "Networked Systems - 5th International Conference, NETYS 2017, Proceedings",
}