skip to content
Hierarchical correctness proofs for distributed algorithms Preview this item
ClosePreview this item
Checking...

Hierarchical correctness proofs for distributed algorithms

Author: Mark R Tuttle; Nancy A Lynch; Massachusetts Institute of Technology. Laboratory for Computer Science.
Publisher: Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1987.
Series: MIT/LCS/TR-, 387.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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. Furthermore, this model can be used to construct modular,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Mark R Tuttle; Nancy A Lynch; Massachusetts Institute of Technology. Laboratory for Computer Science.
OCLC Number: 17833854
Notes: "April 1987."
Originally presented as the author's thesis (M.S.)--MIT.
Thesis supervisor: Nancy A. Lynch.
Description: 86 pages : illustrations ; 28 cm.
Series Title: MIT/LCS/TR-, 387.
Responsibility: by Mark R. Tuttle.

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. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the input-output automaton model, and presents an interesting example of how this model can be used to construct such proofs.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/17833854>
library:oclcnum"17833854"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/906992>
rdf:typeschema:Intangible
schema:name"Electronic data processing--Distributed processing--Mathematical models."@en
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/154819218>
rdf:typeschema:Organization
schema:name"Massachusetts Institute of Technology. Laboratory for Computer Science."
schema:contributor
schema:creator
schema:datePublished"1987"
schema:description"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. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the input-output automaton model, and presents an interesting example of how this model can be used to construct such proofs."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/355439801>
schema:inLanguage"en"
schema:isPartOf
schema:name"Hierarchical correctness proofs for distributed algorithms"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.