Probabilistic verification of hierarchical leader election protocols in dynamic systems

Zhou, Y. and Zhou, N. and Han, Tingting and Gu, J. and Wu, W. (2018) Probabilistic verification of hierarchical leader election protocols in dynamic systems. Frontiers of Computer Science 12 (4), pp. 763-776. ISSN 2095-2228.

Abstract

Leader election protocols are fundamental for coordination problems—such as consensus—in distributed computing. Recently, hierarchical leader election protocols have been proposed for dynamic systems where processes can dynamically join and leave, and no process has global information. However, quantitative analysis of such protocols is generally lacking. In this paper, we present a probabilistic model checking based approach to verify quantitative properties of these protocols. Particularly, we employ the compositional technique in the style of assume-guarantee reasoning such that the sub-protocols for each of the two layers are verified separately and the correctness of the whole protocol is guaranteed by the assume-guarantee rules. Moreover, within this framework we also augment the proposed model with additional features such as rewards. This allows the analysis of time or energy consumption of the protocol. Experiments have been conducted to demonstrate the effectiveness of our approach.

Metadata

Available Versions of this Item

• Probabilistic verification of hierarchical leader election protocols in dynamic systems. (deposited 25 Jan 2017 11:50)

Statistics

DownloadsShow export options

Export as XMLJSONCSV

Activity Overview

6 month trend

348Downloads

6 month trend

196Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item