A specification and verification of intermittent global order broadcast
Name
57146293-MIT.pdf
Description
Full printable version
Size
3.11 MB
Format
Adobe PDF
Checksum (MD5)
48169f878285fc7ddfdd42bfa6407473
Author(s)
Matlon, Catherine A. (Catherine Ann), 1981-
Advisor(s)
Nancy A. Lynch and Roger I. Khazan.
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
The goal of my thesis is to specify, model and verify intermittent global order broadcast. Broadcast means that every process in the system receives a copy of every message. Global order means that all processes deliver the messages in the same order. Intermittent global order means that global order holds (luring periods of stability and there are no guarantees during periods of instability. A group of processes is stable if each process can communicate with each other process with some minimal quality of service and no process can communicate with another process outside the group. Intermittent properties, such as intermittent global order, are useful for certain collaborative applications operating in dynamic environments. They help balance conflicting needs for the different applications. We want to be able to formally specify intermittent properties in order to precisely express the guarantees provided by these applications and to be able to verify the algorithms implementing these properties. Because the guarantees hold intermittently, simply stating a definition and building a state-machine specification for an intermittent property is non-trivial. The same is true about verifying that an algorithm satisfies an intermittent property. Existing specification and verification techniques may need to be adjusted.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, June 2004.
"May 2004."
Includes bibliographical references (leaf 73).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
