Key points are not available for this paper at this time.
A procedure is described for developing an interconnection matrix that specifies a cascade connection of two known digraphs to form a digraph. The solution of this form of the interconnection problem can be applied to complete the process of description of a binary relation initiated by the process of partitioning on elements described in a companion paper 3. It is assumed that the contextual relation being modeled is transitive. Based on this assumption, it is shown that the possibilities of interconnection can be completely prescribed in a characteristic logic equation. This equation can be used as the complete basis for development of an interconnection matrix. An example of its use is given. Much of the burden of structural modeling is assigned to the computer, leaving to the developer the tasks requiring substantive knowledge of the system being modeled.
John Warfield (1974) studied this question.