Verifying Fault Tolerance of Distributed Algorithms Formally - An Example

Authors:
Hagen Völzer
Affiliations:
-
Venue:
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Year:
1998

Citing 0
Cited 4

Fundamentals of fault-tolerant distributed computing in asynchronous environments

ACM Computing Surveys (CSUR)
Flexibility in Algebraic Nets

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Model-based failure management for distributed reactive systems

Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues
Issues on the design of efficient fail-safe fault tolerance

ISSRE'09 Proceedings of the 20th IEEE international conference on software reliability engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.