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.
This is the latest version of this item.
|
Text
FCS_draft.pdf - Author's Accepted Manuscript Download (164kB) | Preview |
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
| Item Type: | Article |
|---|---|
| Additional Information: | The final publication is available at Springer via the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Data Analytics, Birkbeck Institute for |
| Depositing User: | Dr Tingting Han |
| Date Deposited: | 22 Sep 2017 13:01 |
| Last Modified: | 09 Aug 2023 12:42 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/19777 |
Available Versions of this Item
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
