Issue No. 05 - May (1993 vol. 42)

ISSN: 0018-9340

pp: 591-596

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.223678

ABSTRACT

<p>Several problems in switching theory such as automatic test pattern generation, can be exactly and elegantly investigated by using switching equations. An efficient tabular method is presented to solve these switching equations. The solutions of a given equation are compacted into a table, and a Boolean algebra is defined for these tables. The proposed procedure is based on the use of this Boolean algebra. The compactness and simplicity of the method are outstanding, and it is straightforward to implement for computer processing. The complexity of the procedure is computed, and some experimental results for a set of benchmark equations are provided in order to point out the effectiveness of this method.</p>

INDEX TERMS

switching theory; automatic test pattern generation; switching equations; tabular method; Boolean algebra; computer processing; complexity; benchmark equations; Boolean algebra; computational complexity; switching theory.

CITATION

P.P. Trabado, A. Lloris-Ruiz, J. Ortega-Lopera, "Solution of Switching Equations Based on a Tabular Algebra",

*IEEE Transactions on Computers*, vol. 42, no. , pp. 591-596, May 1993, doi:10.1109/12.223678