Verifying fault tolerance of distributed algorithms formally-an example
Hagen Völzer · 2002
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.