1 citations · 3 across the 11 of their papers we have counts for
12 papers
Self-Correcting Gossip Protocols
Giorgio Cignarale, Hans van Ditmarsch, Stephan Felber +3
We investigate self-correcting gossip protocols with errors. In distributed computing, protocols with errors have been widely investigated in temporal epistemic logics. Instead, we…
A Dynamic Deontic Simplicial Logic for Joint Commitments
Giorgio Cignarale, Hugo Rincon Galeana
We introduce the Deontic Simplicial Logic (DSL), a deontic logic for group obligations grounded in simplicial complexes: vertices encode individual commitments, and higher-dimensio…
Lower Bounds for -Set Agreement in Fault-Prone Networks
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz +2
We develop a new lower bound for k-set agreement in synchronous message-passing systems connected by an arbitrary directed communication network, where up to t processes may crash.…
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…
Knowledge in multi-robot systems: an interplay of dynamics, computation and communication
Giorgio Cignarale, Stephan Felber, Eric Goubault +2
In this paper, we provide a framework integrating distributed multi-robot systems and temporal epistemic logic. We show that continuous-discrete hybrid systems are compatible with…
A Sufficient Epistemic Condition for Solving Stabilizing Agreement
Giorgio Cignarale, Stephan Felber, Hugo Rincon Galeana
In this paper we provide a first-ever epistemic formulation of stabilizing agreement, defined as the non-terminating variant of the well established consensus problem. In stabilizi…
Stabilizing Consensus is Impossible in Lossy Iterated Immediate Snapshot Models
Stephan Felber, Hugo Rincon Galeana
A substantial portion of distributed computing research is dedicated to terminating problems like consensus and similar agreement problems. However, non-terminating problems have b…
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems
Hugo Rincon Galeana, Ulrich Schmid
Whereas distributed computing research has been very successful in exploring the solvability/impossibility border of distributed computing problems like consensus in representative…
Topological Characterization of Consensus Solvability in Directed Dynamic Networks
Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler +2
Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communicati…
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries
Ami Paz, Hugo Rincon Galeana, Stefan Schmid +2
Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which com…
Continuous Tasks and the Chromatic Simplicial Approximation Theorem
Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep connec…
H-Kernels by Walks
Hortensia Galeana-Sanchez, Hugo Rincon-Galeana, Ricardo Strausz
We prove that, if every cycle of is an -cycle, then has an -kernel by walks.