Verifying Fault Tolerance of Distributed Algorithms Formally - An Example

@inproceedings{Vlzer1998VerifyingFT,
  title={Verifying Fault Tolerance of Distributed Algorithms Formally - An Example},
  author={Hagen V{\"o}lzer},
  booktitle={ACSD},
  year={1998}
}
It is shown how fault-tolerant distributed algorithms can be formally verified using the Petri net based verification framework DAWN. A complete example study, the verification of a distributed self diagnosis algorithm, is presented to demonstrate the benefits of the proposed approach. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Specifications for Fault Tolerance: A Comedy of Failures

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Simultaneous Fault Models for the Generation of Efficient Error Detection Mechanisms

  • 2017 IEEE 28th International Symposium on Software Reliability Engineering (ISSRE)
  • 2017

Structural Failure Models for Fault-Tolerant Distributed Computing

  • Softwaretechnik-Trends
  • 2010
VIEW 2 EXCERPTS
CITES BACKGROUND

Issues on the Design of Efficient Fail-Safe Fault Tolerance

  • 2009 20th International Symposium on Software Reliability Engineering
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND

Recording Process Documentation in the Presence of Failures

  • Methods, Models and Tools for Fault Tolerance
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND

Verifying architectural variabilities in software fault tolerance techniques

  • 2009 Joint Working IEEE/IFIP Conference on Software Architecture & European Conference on Software Architecture
  • 2009
VIEW 1 EXCERPT
CITES BACKGROUND