Hierarchical Correctness Proofs for Distributed Algorithms
Name
MIT-LCS-TR-387.pdf
Size
3.83 MB
Format
Adobe PDF
Checksum (MD5)
493da73f0bb9158c5d355d9d9b72f097
Author(s) •
Lynch, Nancy A.
Tuttle, Mark S.
Date Issued
April 1987
Series/Report no.
MIT-LCS-TR-387
Abstract
This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. This simple, powerful model captures in a novel way the game-theoretical interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed.
Persistent DSpace Link