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
%0 Journal Article
%1 mouna2009reduction
%A Chaouch-Saad, Mouna
%A Charron-Bost, Bernadette
%A Merz, Stephan
%D 2009
%J Reachability Problems
%K distributed homodel reduction roundbased verification
%P 93--106
%T A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
%U http://dx.doi.org/10.1007/978-3-642-04420-5_10
%X 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.
@article{mouna2009reduction,
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.},
added-at = {2010-01-26T17:07:24.000+0100},
author = {Chaouch-Saad, Mouna and Charron-Bost, Bernadette and Merz, Stephan},
biburl = {https://www.bibsonomy.org/bibtex/27738add53acbf0686fa1b834a92fad6e/giuliano.losa},
description = {A Reduction Theorem for the Verification of Round-Based Distributed Algorithms},
interhash = {a7ab7592a67867615342db0baddf57fa},
intrahash = {7738add53acbf0686fa1b834a92fad6e},
journal = {Reachability Problems},
keywords = {distributed homodel reduction roundbased verification},
pages = {93--106},
timestamp = {2010-01-26T17:07:25.000+0100},
title = {A Reduction Theorem for the Verification of Round-Based Distributed Algorithms},
url = {http://dx.doi.org/10.1007/978-3-642-04420-5_10},
year = 2009
}