Hierarchical Correctness Proofs for Distributed Algorithms
| dc.contributor.author | Lynch, Nancy A. | en_US |
| dc.contributor.author | Tuttle, Mark S. | en_US |
| dc.date.accessioned | 2023-03-29T15:14:34Z | |
| dc.date.available | 2023-03-29T15:14:34Z | |
| dc.date.issued | 1987-04 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149651 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-387 | |
| dc.title | Hierarchical Correctness Proofs for Distributed Algorithms | en_US |
| dc.identifier.oclc | 17833854 |
