2026-09-19T19:37:48Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/479042026-06-05T20:27:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131024

Stephen J. Garland and Nancy A. Lynch. Chefter, Anna E., 1973- Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2009-10-01T16:01:29Z 2009-10-01T16:01:29Z 1998 1998 http://hdl.handle.net/1721.1/47904 46988521 Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998. Includes bibliographical references (p. 96-98). With current advances in networking, distributed computing is becoming more commonplace. Distributed systems are hard to design and reason about, because distributed actions can exhibit arbitrary interleaving. In order to make it easier to design and analyze distributed systems, Nancy Lynch and her students have developed a formal mathematical model, the input/output (I/O) automaton model, for describing asynchronous concurrent systems. Based on the I/O automaton model, a new programming language, the IOA language, together with a suite of tools for testing, verifying, and analyzing distributed algorithms is being developed at MIT. The topic of this thesis is a simulator for the IOA language. Simulation allows one to test and debug algorithms, and it can provide insight that is helpful in understanding algorithms and in constructing correctness proofs for them. The simulator can be used to study the performance of an algorithm under varying conditions. Other contributions of this thesis are the design of an intermediate language that can be used by other IOA tools and the development of a tool that transforms an IOA program into the intermediate representation. by Anna E. Chefter. S.B. M.Eng. 98 p. eng Massachusetts Institute of Technology 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. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. A simulator for the IOA language Simulator for the input/output automaton language Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7c9c86e7-29e4-40bb-bc25-8e98db8321fb"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>A simulator for the IOA language</Title> <Subtitle>Simulator for the input/output automaton language</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>1998</PublicationDate> <Authors> <Author> <DisplayName>Chefter, Anna E., 1973-</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>With current advances in networking, distributed computing is becoming more commonplace. Distributed systems are hard to design and reason about, because distributed actions can exhibit arbitrary interleaving. In order to make it easier to design and analyze distributed systems, Nancy Lynch and her students have developed a formal mathematical model, the input/output (I/O) automaton model, for describing asynchronous concurrent systems. Based on the I/O automaton model, a new programming language, the IOA language, together with a suite of tools for testing, verifying, and analyzing distributed algorithms is being developed at MIT. The topic of this thesis is a simulator for the IOA language. Simulation allows one to test and debug algorithms, and it can provide insight that is helpful in understanding algorithms and in constructing correctness proofs for them. The simulator can be used to study the performance of an algorithm under varying conditions. Other contributions of this thesis are the design of an intermediate language that can be used by other IOA tools and the development of a tool that transforms an IOA program into the intermediate representation.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>