Analysis of combinational networks with mathematics

This paper focuses on automated computer-aided symbolic analysis of combinational networks. A novel program is presented to carry out the symbolic analysis, and to derive closed-form formulas for the response of combinational networks, for excitations specified by symbols or symbolic expressions. The source code listing of the program is presented. The program operation is fully illustrated by an example. The symbolic analysis addressed in this work can serve as a basis of efficient programs for variety of logic design tasks, including logic simulation, fault simulation, test generation, and symbolic verification. The advantages of the proposed approach are discussed. Scientists, researchers, designers, educators and students dealing with combinational networks can benefit from the symbolic approach considered in this paper.