Verifying fault tolerance of distributed algorithms formally

For the most recent entries see the Petri Nets Newsletter.

Verifying fault tolerance of distributed algorithms formally - an example.

In: Proc. 1998 Int. Conf. on Application of Concurrency to System Design (CSD'98), 23-26 March 1998, Fukushima, Japan, pages 187-197. 1998.

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.

Keywords: DAWN, High-level Petri nets, distributed algorithms, fault-tolerance verification, formal verification.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography