Chen, Taolue and Han, Tingting and Luo, J. (2005) Analysis of a leader election algorithm in /spl mu/CRL. In: Gu, N. and Wei, D. and Xie, Z. and Wang, H. and Wang, S.X. and Shi, B. (eds.) The Fifth International Conference on Computer and Information Technology. IEEE Computer Society, pp. 841-847. ISBN 076952432X.
Abstract
This paper investigates the applicability of formal methods for the specification and verification of distributed algorithms. The problem of election is an important class of distributed algorithms that are widely studied in the literatures. We prove the correctness of a representative leader election algorithm, that is, the LCR algorithm, developed by LeLann, Chang and Roberts. This algorithm is one of the early election algorithms and serves as a nice benchmark for verification exercises. The verification is based on the /spl mu/CRL, which is a language for specifying distributed systems and algorithms in an algebraic style and combines the process algebra and (equational) data types. We bring the correctness of the algorithm to a completely formal level. It turns out that this relatively "small" and "simple" algorithm requires a rather involved proof for guaranteeing that it behaves well in all possible circumstance. This paper demonstrates the possibility to deliver completely formal and mechanically verifiable correctness proofs of highly nondeterministic distributed algorithm, which is indispensable in the design and implementation of distributed algorithm and systems.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 16 Feb 2021 18:42 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43066 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
