Corpus ID: 8775068

Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms

  title={Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms},
  author={A. John and I. Konnov and U. Schmid and H. Veith and J. Widder},
  • A. John, I. Konnov, +2 authors J. Widder
  • Published 2012
  • Computer Science
  • ArXiv
  • Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and deployment. In this paper, we introduce a new domain-specific framework to capture the behavior of fault-tolerant distributed algorithms in an adequate and precise way. At the center of our framework is a parameterized system model where control flow automata are used… CONTINUE READING
    3 Citations


    On Verifying Fault Tolerance of Distributed Protocols
    • 30
    • Highly Influential
    • PDF
    Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms
    • 12
    • PDF
    Automatically Increasing the Fault-Tolerance of Distributed Algorithms
    • 137
    Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
    • 62
    • PDF
    The Heard-Of model: computing in distributed systems with benign faults
    • 217
    • PDF
    Proving Approximate Implementations for Probabilistic I/O Automata
    • S. Mitra, N. Lynch
    • Mathematics, Computer Science
    • Electron. Notes Theor. Comput. Sci.
    • 2007
    • 12
    • PDF
    On the minimal synchronism needed for distributed consensus
    • 685
    • PDF
    Reconciling fault-tolerant distributed computing and systems-on-chip
    • 31
    • PDF
    Synchronous consensus under hybrid process and link failures☆
    • 43
    • PDF
    The Theory of Timed I/O Automata
    • 234
    • PDF