Treffer: Hierarchical Correctness Proofs for Distributed Algorithms
Title:
Hierarchical Correctness Proofs for Distributed Algorithms
Authors:
Publisher Information:
2023-03-29T15:14:34Z 2023-03-29T15:14:34Z 1987-04
Document Type:
E-Ressource
Electronic Resource
Availability:
Open access content. Open access content
Note:
application/pdf
Other Numbers:
MYG oai:dspace.mit.edu:1721.1/149651
17833854
1378039571
17833854
1378039571
Contributing Source:
MASSACHUSETTS INST OF TECHNOL LIBRS
From OAIster®, provided by the OCLC Cooperative.
From OAIster®, provided by the OCLC Cooperative.
Accession Number:
edsoai.on1378039571
Database:
OAIster
Weitere Informationen
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.