DMCA
Hierarchical correctness proofs for distributed algorithms (1987)
Cached
Download Links
- [www.markrtuttle.com]
- [www.markrtuttle.com]
- [www.markrtuttle.com]
- [www.markrtuttle.com]
- [groups.csail.mit.edu]
- DBLP
Other Repositories/Bibliography
by
Nancy A. Lynch
,
Mark R. Tuttle
| Citations: | 418 - 51 self |
BibTeX
@TECHREPORT{Lynch87hierarchicalcorrectness,
author = {Nancy A. Lynch and Mark R. Tuttle},
title = {Hierarchical correctness proofs for distributed algorithms},
institution = {},
year = {1987}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular, hierarchical correctness proofs for distributed algorithms. We define this model, and give an interesting example of how it can be used to construct such proofs.
