6 papers
On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +2
In this paper, we define a new class of distributed tasks, called SOS tasks (for Set of Output Sets tasks), defined by the set of distinct output sets of values that can be pro…
Context Adaptive Cooperation
Timothé Albouy, Davide Frey, Mathieu Gestin +2
As shown by Reliable Broadcast and Consensus, cooperation among a set of independent computing entities (sequential processes) is a central issue in distributed computing. Consider…
Tight Conditions for Binary-Output Tasks under Crashes
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +2
This paper explores necessary and sufficient system conditions to solve distributed tasks with binary outputs (\textit{i.e.}, tasks with output values in ). We focus on th…
Asynchronous BFT Asset Transfer: Quasi-Anonymous, Light, and Consensus-Free
Timothé Albouy, Emmanuelle Anceaume, Davide Frey +4
This paper introduces a new asynchronous Byzantine-tolerant asset transfer system (cryptocurrency) with three noteworthy properties: quasi-anonymity, lightness, and consensus-freed…
AMECOS: A Modular Event-based Framework for Concurrent Object Specification
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +3
In this work, we introduce a modular framework for specifying distributed systems that we call AMECOS. Specifically, our framework departs from the traditional use of sequential sp…
Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
Timothé Albouy, Davide Frey, Ran Gelles +5
We address the problem of Reliable Broadcast in asynchronous message-passing systems with nodes, of which up to are malicious (faulty), in addition to a message adversary t…