Third International Conference on Network Protocols (ICNP'95) Validation of distributed algorithms and protocols Tokyo, Japan November 07-November 10 ISBN: 0-8186-7216-1
The use of formal description techniques allows the partial automation of the design, the validation, and the implementation of communication protocols and distributed algorithms. In this paper, we present a methodology for validation of distributed algorithms and protocols, and our experiences of using the Estelle language, and a simulation and validation tool, called Veda, to simulate and validate complex distributed algorithms for the distributed implementation of multi-rendezvous. Some design errors in published distributed rendezvous algorithms were found. We obtain from these experiences heuristic guidelines for trouble shooting of distributed algorithms
Index Terms:
distributed algorithms; protocols; specification languages; distributed algorithms; protocols; formal description; validation; communication protocols; Estelle language; Veda; multi-rendezvous; distributed rendezvous algorithms
Citation:
Qiang Gao, R. Groz, G. von Bochmann, J. Dargham, E.H. Htite, "Validation of distributed algorithms and protocols," icnp, pp.110, Third International Conference on Network Protocols (ICNP'95), 1995 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||