Algebraic Specification of Dynamic Leader Election Protocols in Broadcast Networks

This publication has 10 references indexed in Scilit:

• Real time process algebra
  Formal Aspects of Computing, 1991
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
  SIAM Journal on Computing, 1991
• Optimal distributed t-resilient election in complete networks
  IEEE Transactions on Software Engineering, 1990
• Efficient elections in chordal ring networks
  Algorithmica, 1989
• Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
  Published by Springer Nature ,1989
• Fault-tolerant distributed algorithm for election in complete networks
  IEEE Transactions on Computers, 1988
• Electing a leader in a ring with link failures
  Acta Informatica, 1987
• Election in a complete network with a sense of direction
  Information Processing Letters, 1986
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
  ACM Transactions on Programming Languages and Systems, 1982
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
  Communications of the ACM, 1979