Treffer: Hierarchical correctness proofs for distributed algorithms
Title:
Hierarchical correctness proofs for distributed algorithms
Authors:
Contributors:
The Pennsylvania State University CiteSeerX Archives
Publication Year:
1987
Collection:
CiteSeerX
Document Type:
Fachzeitschrift
text
File Description:
application/pdf
Language:
English
Availability:
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.B22A50E6
Database:
BASE
Weitere Informationen
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 de ne this model, and give aninteresting example of how itcan be used to construct such proofs. 1