2 papers
cs.DC2025
A Sheaf-Theoretic Characterization of Tasks in Distributed Systems
Stephan Felber, Bernardo Hummes Flores, Hugo Rincon Galeana
We introduce a sheaf-theoretic characterization of task solvability in general distributed computing models, unifying distinct approaches to message-passing models. We establish ce…
cs.LO2025
A categorical and logical framework for iterated protocols
Eric Goubault, Bernardo Hummes Flores, Roman Kniazev +2
In this article, we show that the now classical protocol complex approach to distributed task solvability of Herlihy et al. can be understood in standard categorical terms. First,…