@InProceedings{ledent_et_al:LIPIcs.CONCUR.2019.34,
author = {Ledent, J\'{e}r\'{e}my and Mimram, Samuel},
title = {{A Sound Foundation for the Topological Approach to Task Solvability}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.34},
URN = {urn:nbn:de:0030-drops-109365},
doi = {10.4230/LIPIcs.CONCUR.2019.34},
annote = {Keywords: Fault-tolerant protocols, Asynchronous computability, Combinatorial topology, Protocol complex, Distributed task}
}