Biely, MartinRobinson, Peter2019-09-202019-09-202019-09-202019-01-0110.1145/3288599.3288614https://infoscience.epfl.ch/handle/20.500.14299/161295WOS:000484491600013We 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.consensustext::conference output::conference proceedings::conference paper