Login

Simulation of composite I/O automata

Show full item record




Title: Simulation of composite I/O automata
Author: Solovey, Edward, 1979-
Other Contributors: Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor: Dilsun K. Kaynar and Nancy Lynch.
Department: Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Publisher: Massachusetts Institute of Technology
Issue Date: 2003
Abstract: The IOA simulator is a tool that has been developed in the Theory of Distributed Systems group at MIT. This tool simulates the execution of automata described by the IOA language. It generates logs of execution traces and provides other pertinent information regarding the execution, such as the validity of specified invariants. Although the simulator supports paired simulation of two automata for the purpose of checking simulation relations, one of its limitations is its lack of support for the simulation of composite automata. A composite automaton represents a complex system and is made up of other automata, each representing a system component. This thesis concerns the addition of a capability to simulate composite automata in a manner that allows observing and debugging the individual system component automata. While there is work in progress on creating a tool that will translate a composite definition into a single automaton, the added ability to simulate composite automata directly will add modularity and simplicity, as well as ease of observing the behavior of individual components for the purpose of distributed debugging.
Description: Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.Includes bibliographical references (p. 107-108).
URI: http://hdl.handle.net/1721.1/18033
Keywords: Electrical Engineering and Computer Science.

Files in this item

Files Size Format View Description
Preview, non-printable (open to all) 5.346Mb PDF View/Open Preview, non-printable (open to all)
Full printable version (MIT only) 5.359Mb PDF View/Open Full printable version (MIT only)

This item appears in the following Collection(s)

Show full item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links