Solution of Switching Equations Based on a Tabular Algebra

IEEE Transactions on Computers

Volumn 42, Issue 5, 1993, Pages 591-596

  Trabado, Pablo P ^a   Lloris Ruiz, Antonio ^b   Ortega Lopera, Julio ^b  

^a UNIVERSITY OF MURCIA   (Spain)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

Algebra; Algebraic test pattern generation; Boolean Al ; gebra; switching equations; tabular Boolean; tabular methods

Indexed keywords

AUTOMATIC TESTING; BOOLEAN ALGEBRA; ELECTRONIC EQUIPMENT TESTING; INTEGRATED CIRCUIT TESTING;

SWITCHING EQUATIONS; TABULAR ALGEBRA; TEST PATTERN GENERATION;

SWITCHING THEORY;

EID: 0027595026     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.223678     Document Type: Article

References (15)

1. G. Boole, An Investigation of the Laws of Thought. London, 1854. Reprinted by Dover, New York.
2. S. Rudeanu, Boolean Functions and Equations. Amsterdam, The Netherlands: North-Holland, 1974.
3. “An algebraic approach to Boolean equations,” IEEE Trans. Comput., pp. 206-207, Feb. 1974.
4. W. Del Picchia, “A numerical algorithm for the resolution for Boolean equations,” IEEE Trans. Comput., vol. C-23, pp. 983–986, Sept. 1974
5. S. Svoboda, “An algorithm for solving Boolean equations,” IEEE Trans. Electron. Comput., pp. 557–559, Oct. 1963.
6. M. R. Garey, D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
7. F. F. Sellers, M. Y. Hsiao, and L. W. Bearnson, “Analyzing errors with Boolean difference,” IEEE Trans. Comput., vol. C-17, pp. 676–683, July 1968.
8. P. R. Bhattacharjee, S. K. Basu, and J. C. Paul, “Translation of the problem of complete test set generation to pseudo-Boolean programming,” IEEE Trans. Comput., vol. C-40, pp. 864–867, July 1991.
9. B. Krishnamurthy and J. G. Tollis, “Improved techniques for estimating signal probabilities,” IEEE Trans. Comput., pp. 1041–1045, July 1989.
10. J. Savir, G. S. Ditlow, and P. H. Bardell, “Random pattern testability,” IEEE Trans. Comput., pp. 79–90, Jan. 1984.
11. F. W. Clegg, “Use of SPOOF’s in the analysis of faulty logic networks,” IEEE Trans. Comput., pp. 229–234, Mar. 1973.
12. F. W. Clegg and E. J. McCluskey, “Algebraic properties of faults in logic networks,” IEEE Comput. Soc. Repository, pp. 71–106, 1970.
13. F. M. Hall, An Introduction to Abstract Algebra, (vol. 2). Cambridge, MA: Cambridge University Press, 1969.
14. S. A. Cook, “The complexity of theorem proving procedures,” in Proc. 3rd ACM Symp. Theory Comput., 1971, pp. 151–158.
15. B. Krishnamurthy, “Short proofs for tricky formulas,” Acta Informatica, vol. 22, pp. 253–275, 1985.