Publication

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely
2019
Conference Papers

Abstract

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.

Official source

https://infoscience.epfl.ch/entities/publication/27cd48ff-8737-4469-98a7-f38dcfb8b537

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Hardness of the Strongly Dependent Decision Problem

Chat with Graph Search

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Dynamical system approach to navigation around obstacles

Reliable data-driven decision-making through optimal transport