HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

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 individual events corresponds to a coarser-grained execution based on global rounds such that the local views of all processes are identical in the two executions. This result helps us to substantially mitigate state-space explosion and verify Consensus algorithms using standard model checking techniques.
Document type :
Conference papers
Complete list of metadata

Contributor : Stephan Merz Connect in order to contact the contributor
Submitted on : Tuesday, August 4, 2009 - 12:09:50 PM
Last modification on : Friday, February 4, 2022 - 3:20:33 AM

Links full text




Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms. Reachability Problems 2009, Sep 2009, Palaiseau, France. pp.93-106, ⟨10.1007/978-3-642-04420-5_10⟩. ⟨inria-00408908⟩



Record views