Survey of Distributed Decision

We survey the recent distributed computing literature on checking whether a given distributed system configuration satisfies a given boolean predicate, i.e., whether the configuration is legal or illegal w.r.t. that predicate. We consider classical distributed computing environments, including mostly synchronous fault-free network computing (LOCAL and CONGEST models), but also asynchronous crash-prone shared-memory computing (WAIT-FREE model), and mobile computing (FSYNC model).

[1]  David Ilcinkas,et al.  On Mobile Agent Verifiable Problems , 2016, LATIN.

[2]  Nicola Santoro,et al.  Distributed Computing by Oblivious Mobile Robots , 2012, Synthesis Lectures on Distributed Computing Theory.

[3]  Fabian Reiter,et al.  Distributed Graph Automata , 2014, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[4]  David Peleg,et al.  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[5]  Pierre Fraigniaud,et al.  On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems , 2014, RV.

[6]  David Peleg,et al.  Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification , 2013, Theory of Computing Systems.

[7]  Heger Arfaoui,et al.  What can be computed without communications? , 2012, SIGA.

[8]  Christoph Lenzen,et al.  "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.

[9]  Pierre Fraigniaud,et al.  Distributed Detection of Cycles , 2017, SPAA.

[10]  Andrzej Pelc,et al.  Local Decision and Verification with Bounded-Size Outputs , 2013, SSS.

[11]  Janne H. Korhonen,et al.  Deterministic Subgraph Detection in Broadcast CONGEST , 2017, OPODIS.

[12]  Roger Wattenhofer,et al.  Local checkability, no strings attached , 2016, ICDCN.

[13]  Pierre Fraigniaud,et al.  Decentralized Asynchronous Crash-Resilient Runtime Verification , 2016, CONCUR.

[14]  Pierre Fraigniaud,et al.  Node Labels in Local Decision , 2015, SIROCCO.

[15]  Pierre Fraigniaud,et al.  Local Distributed Verification , 2016, ArXiv.

[16]  Rafail Ostrovsky,et al.  Space-Time Tradeoffs for Distributed Verification , 2016, SIROCCO.

[17]  Leonid A. Levin,et al.  Fast and lean self-stabilizing asynchronous protocols , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[18]  Pierre Fraigniaud,et al.  The Opinion Number of Set-Agreement , 2014, OPODIS.

[19]  Ivan Rapaport,et al.  Distributed Testing of Excluded Subgraphs , 2016, DISC.

[20]  Andrzej Pelc,et al.  Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.

[21]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[22]  Pierre Fraigniaud,et al.  Local MST computation with short advice , 2007, SPAA.

[23]  Pierre Fraigniaud,et al.  Randomized Local Network Computing , 2015, SPAA.

[24]  Pierre Fraigniaud,et al.  Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[25]  Ami Paz,et al.  Approximate Proof-Labeling Schemes , 2017, SIROCCO.

[26]  Jukka Suomela,et al.  Towards a Complexity Theory for the Congested Clique , 2018, SPAA.

[27]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[28]  Boaz Patt-Shamir,et al.  Randomized Proof-Labeling Schemes , 2015, PODC.

[29]  Pierre Fraigniaud,et al.  On the Impact of Identifiers on Local Decision , 2012, OPODIS.

[30]  Christoph Lenzen,et al.  Algebraic methods in the congested clique , 2015, Distributed Computing.

[31]  Heger Arfaoui,et al.  Distributedly Testing Cycle-Freeness , 2014, WG.

[32]  Shay Kutten,et al.  Proof labeling schemes , 2005, PODC '05.

[33]  Andrzej Pelc,et al.  Decidability classes for mobile agents computing , 2010, J. Parallel Distributed Comput..

[34]  Hartmut Klauck,et al.  Distributed Computation of Large-scale Graph Problems , 2015, SODA.

[35]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[36]  Roger Wattenhofer,et al.  Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs , 2014, ICALP.

[37]  Pierre Fraigniaud,et al.  A hierarchy of local decision , 2016, ICALP.

[38]  Stefan Schmid,et al.  Exploiting locality in distributed SDN control , 2013, HotSDN '13.

[39]  Shay Kutten,et al.  Distributed verification of minimum spanning trees , 2006, PODC '06.

[40]  Mika Göös,et al.  Locally checkable proofs , 2011, PODC '11.

[41]  Pierre Fraigniaud.  Locality in Distributed Graph Algorithms , 2016, Encyclopedia of Algorithms.

[42]  Moti Yung,et al.  The Local Detection Paradigm and Its Application to Self-Stabilization , 1997, Theor. Comput. Sci..

[43]  Pierre Fraigniaud,et al.  What can be decided locally without identifiers? , 2013, PODC '13.

[44]  Boaz Patt-Shamir,et al.  Proof-Labeling Schemes: Broadcast, Unicast and in Between , 2017, SSS.

[45]  Peter Robinson,et al.  Fast Distributed Algorithms for Connectivity and MST in Large Graphs , 2015, SPAA.

[46]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

[47]  Pierre Fraigniaud,et al.  Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings , 2016, LATIN.

[48]  Roger Wattenhofer,et al.  Anonymous networks: randomization = 2-hop coloring , 2014, PODC.

[49]  Pierre Fraigniaud,et al.  Locality and Checkability in Wait-Free Computing , 2011, DISC.

[50]  Andrzej Pelc,et al.  Communication algorithms with advice , 2010, J. Comput. Syst. Sci..

[51]  Pierre Fraigniaud,et al.  Randomized distributed decision , 2012, Distributed Computing.

[52]  Boaz Patt-Shamir,et al.  On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms , 2014, SSS.

[53]  Eldar Fischer,et al.  Fast distributed algorithms for testing graph properties , 2016, Distributed Computing.

[54]  Nicolas Nisse,et al.  Allowing each node to communicate only once in a distributed system: shared whiteboard models , 2014, Distributed Computing.

[55]  Toshimitsu Masuzawa,et al.  Fast and compact self-stabilizing verification, computation, and fault detection of an MST , 2011, PODC '11.

[56]  Petr Kuznetsov,et al.  Perfect Failure Detection with Very Few Bits , 2016, SSS.

[57]  Pierre Fraigniaud.  Distributed computational complexities: are you volvo-addicted or nascar-obsessed? , 2010, PODC '10.

[58]  Jarkko Kari,et al.  Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model , 2015, SIROCCO.

[59]  Pierre Fraigniaud,et al.  Towards a complexity theory for local distributed computing , 2013, JACM.