Characterisation of microinstructions as destructible flows in controlled graphs

Abstract

The flow of control signals in digital computers is modelled as destructible flows in controlled graphs where each vertex i ε V(G) represents some module of a system zn. By establishing a flow path from vertex i to vertex j an edge x ε E(G) is created which represents a microinstruction. For all sets of vertices V(G) exist a connectivity matrix C on which a set of microinstructions μ I(zn) can be defined. The model can be used to answer several computer design questions including cost-effective control paths, control functions extensions and coding and in digital systems design optimization.