On the Hardness of the Strongly Dependent Decision Problem

09/28/2018
by   Martin Biely, et al.
0

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchronous systems, we show that any algorithm that solves the SDD problem induces a set of executions that is closed with respect to the point-set topology. We also show that the SDD problem is not solvable in the asynchronous system augmented with any arbitrarily strong failure detectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2018

Ring Exploration with Myopic Luminous Robots

We investigate exploration algorithms for autonomous mobile robots evolv...
research
04/16/2019

Distributed Computing in the Asynchronous LOCAL model

The LOCAL model is among the main models for studying locality in the fr...
research
03/12/2018

Asynchronous Crash-Tolerant Consensus in Directed Graphs: Randomization and Topology Knowledge

Consider a directed point-to-point network. We are interested in the asy...
research
10/27/2020

Topological Interference Management with Confidential Messages

The topological interference management (TIM) problem refers to the stud...
research
08/21/2023

Weakly synchronous systems with three machines are Turing powerful

Communicating finite-state machines (CFMs) are a Turing powerful model o...
research
12/18/2020

Partitionable Asynchronous Cryptocurrency Blockchain

We consider operation of blockchain-based cryptocurrency in case of part...
research
07/28/2023

On new generalized differentials with respect to a set and their applications

The notions and certain fundamental characteristics of the proximal and ...

Please sign up or login with your details

Forgot password? Click here to reset