Controlled graphs and instructions

摘要

This paper is concerned with controlled graphs, a graph-theoretic formalism which was developed from the study of microprogramming. In this formalism, a microinstruction is equivalent to a subgraph of the graph representing the (microprogrammed) computer, and the problem of designing a micro-instruction is simply that of finding an appropriate subgraph. However, this idea can be generalized and applied to other networks which are characterized by flows of discrete elements. The results of one instruction or of a sequence of instructions, a natural notion for a programmer, are developed for controlled graphs in this paper.