Roy E. Heistand
Abstract
The 473L command and control system used by the Air Force permits many operators to access large data files through the use of a computer. The man-machine interface is satisfied by several communication consoles from which operators may enter queries and view replies. A data link permits remote stations to send messages, status reports and inventories directly to the computer. The information received over the online data link is used to update the data files which are stored on disk.
The 473L programming system is divided into an Executive Control Program and five components with different processing priorities. These priorities permit the system to be most sensitive to the console inputs and permit the operators at all the consoles to time share the central processor. The Executive Control Program provides for the orderly transitions of control among the programming system components. The major emphasis of the paper is on the technique of using the definition of a finite-state automaton for organizing the Executive Control Program.
- 1 ARBIB, M. A. Brains, Machines, and Mathematics. McGraw- Hill, New York, 1964, 7-13. Google Scholar
Digital Library
- 2 BURKS, A. W., AND WANG, H. The logic of automata-part 1. J. ACM 4 (Apr. 1957), 193-218. Google ScholarDigital Library
- 3 COLLINS, G. O., JR. Experience in automatic storage allocation. Comm. ACM 4 (Oct. 1961), 436-440. Google ScholarDigital Library
- 4 FRANK, W. L., GARDNER, W. H. AND STOCK, G.L. Programming on-line systems-part two. Datamation (Jun. 1963), 28-32.Google Scholar
- 5 GILL, A. Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York, 1962.Google Scholar
- 6 HEISING, W. P. AND LARNER, R.A. A semi-automatic storage allocation system at loading time. Comm. ACM 4 (Oct. 1961), 446-449. Google ScholarDigital Library
- 7 HOLT, A. W. Program organization and record keeping for dynamic storage allocation. Comm. ACM 4 (Oct. 1961), 422- 431. Google ScholarDigital Library
Index Terms
- An executive system implemented as a finite-state automaton
Recommendations
From Two-Way to One-Way Finite State Transducers
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceAny two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherd son, states that two-way finite state automata (even non-deterministic) characterize ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
MSO definable string transductions and two-way finite-state transducers
We extend a classic result of Büchi, Elgot, and Trakhtenbrot: MSO definable string transductions i.e., string-to-string functions that are definable by an interpretation using monadic second-order (MSO) logic, are exactly those realized by deterministic ...
Comments