@giuliano.losa

A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

, , and . Reachability Problems, (2009)

Abstract

We consider the verification of algorithms expressed in the Heard-Of Model, a round-based computational model for fault-tolerant distributed computing. Rounds in this model are communication-closed, and we show that every execution recording individualevents corresponds to a coarser-grained execution based on global rounds such that the local views of all processes are identicalin the two executions. This result helps us to substantially mitigate state-space explosion and verify Consensus algorithmsusing standard model checking techniques.

Description

A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

Links and resources

Tags

community

  • @giuliano.losa
  • @dblp
@giuliano.losa's tags highlighted