Specification and verification of various distributed leader election algorithms for unidirectional ring networks
- 31 July 1997
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 29 (1-2) , 171-197
- https://doi.org/10.1016/s0167-6423(96)00034-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Introduction to the ISO specification language LOTOSPublished by Elsevier ,2003
- Design and analysis of dynamic leader election protocols in broadcast networksDistributed Computing, 1996
- Introduction to algebraic specifications based on the language ACT ONEComputer Networks and ISDN Systems, 1992
- The existence of refinement mappingsTheoretical Computer Science, 1991
- An implementation of an efficient algorithm for bisimulation equivalenceScience of Computer Programming, 1990
- Exhaustive analysis and simulation for distributed systems, both sides of the same coinDistributed Computing, 1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977