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


    Publications referenced by this paper.
    On Verifying Fault Tolerance of Distributed Protocols
    • 29
    • Highly Influential
    • PDF
    Automatically Increasing the Fault-Tolerance of Distributed Algorithms
    • 136
    On the minimal synchronism needed for distributed consensus
    • 677
    • PDF
    Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms
    • 11
    • PDF
    Consensus in the presence of partial synchrony
    • 1,407
    • PDF
    The Theory of Timed I/O Automata
    • 232
    • PDF
    An introduction to input/output automata
    • 1,283
    • PDF