Accession Number:

ADA210831

Title:

An Introduction to Input/Output Automata. Revision

Descriptive Note:

Technical rept.

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE

Personal Author(s):

• Lynch, Nancy A.
• Tuttle, Mark R.

Report Date:

1988-11-18

Pagination or Media Count:

27.0

Abstract:

The inputoutput automation model has recently been defined, in LT1, LT2, as a tool for modeling concurrent and distributed discrete event systems of the sorts arising in computer science. Since its introduction, the model has been used for describing and reasoning about several different types of systems, including network resource allocation algorithms, communication algorithms, concurrent database systems, shared atomic objects, and dataflow architectures. This paper is intended to introduce researchers to the model. It is organized as follows. Section 2 contains an overview of the model. Section 3 defines the model formally and examines several illustrative examples concerning candy vending machines. Section 4 contains a second example, a leader election algorithm. Finally, Section 5 contains a survey of some of the uses that have so far been made of the model. Keywords IO automata, Asynchronous systems, Concurrency, Computer modeling, Data transfer.

Descriptors:

• *AUTOMATA
• *DATA BASES
• *INFORMATION TRANSFER
• LEADERSHIP
• ASYNCHRONOUS SYSTEMS
• NETWORKS
• COMPUTERS
• REASONING
• INPUT OUTPUT PROCESSING
• ALLOCATIONS
• COMMUNICATION AND RADIO SYSTEMS
• RESOURCE MANAGEMENT
• INPUT OUTPUT MODELS
• AUTOMATION
• COMPUTERIZED SIMULATION
• ELECTIONS
• ALGORITHMS

Subject Categories:

• Computer Programming and Software
• Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE