This Article 
 Bibliographic References 
 Add to: 
The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits
June 1989 (vol. 38 no. 6)
pp. 865-869
The authors show that the problem of obtaining a minimum complete test set is NP-complete for monotone PLAs even when each product term of the PLA contains at most two literals. Using the ideas developed in the proof of this result, they resolve an open question due to B. Krishnamurthy and S.B. Akers (1984). The authors also show that given a complete test set T, the problem of obtaining a mini

[1] V. K. Agarwal, "Multiple fault detection in PLA's," inProc. 9th Int. Conf. Fault Tolerant Comput., June 1979, pp. 227-234.
[2] P. Bose and J. A. Abraham, "Test generation for programmable logic arrays," inProc. 19th Design Automat. Conf., Las Vegas, NV, June 1982, pp. 574-580.
[3] R. Bentacourt, "Derivation of minimal test sets for unate logic circuits,"IEEE Trans. Comput., vol. C-20, pp. 1264-1269, 1971.
[4] M. A. Breuer and A. D. Friedman,Diagnosis and Reliable Design for Digital Systems. Rockville, MD: Computer Science Press, 1976.
[5] C. W. Cha, "A test strategy for PLAS," inProc. 15th Design Automat. Conf., June 1978, pp. 326-334.
[6] S. K. Chakravarty, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz, "The complexity of generating minimum test sets for PLA's and monotone combinational circuits," Tech. Rep. 85-15, Dep. Comput. Sci., S.U.N.Y. Albany, 1985.
[7] R. Dandapani, "Derivation of minimal test sets for monotone logic circuits,"IEEE Trans. Comput., vol. C-22, pp. 657-661, 1973.
[8] W. H. Debaney, "On using the fanout-free substructure of general combinational networks," Ph.D. dissertation, Syracuse Univ., 1985.
[9] E. B. Eichelberger and E. Lindbloom, "A heuristic test pattern generator for programmable logic arrays,"IBM J. Res. Develop., vol. 24. pp. 15-22, Jan. 1980.
[10] H. Fujiwara and S. Toida, "The complexity of fault detection problems for combinational logic circuits,"IEEE Trans. Comput., vol. C-31, pp. 555-560, 1982.
[11] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[12] S. Hassan and E. J. McClusky, "Testing PLA's using multiple parallel signature analyzers," inProc. 13th Symp. Fault-Tolerant Comput., 1983, pp. 422-425.
[13] O. H. Ibarra and S. K. Sahni, "Polynomially complete fault detection problems,"IEEE Trans. Comput., vol. C-24, pp. 242-249, Mar. 1975.
[14] S. Jain and V. Agrawal. "STAFAN: An Alternative to Fault Simulation,"Proc. Design Automation Conf., 1984, pp. 18-23.
[15] B. Krishnamurthy and S. B. Akers, "On the complexity of estimating the size of a test set,"IEEE Trans. Comput., vol. C-33, pp. 750- 753, Aug. 1984.
[16] E. I. Muehldorf and T. W. Williams, "Optimized stuck-at fault test pattern generation for PLA macros," inDig. Semiconductor Test Symp., Oct. 1977, pp. 89-101.
[17] D. L Ostapko and S. J. Hong, "Fault analysis and test generation for programmable logic arrays,"IEEE Trans. Comput., vol. C-28, pp. 617-627, Sept. 1979.
[18] S. M. Reddy and D. S. Ha, "A new approach to the design of testable PLA's,"IEEE Trans. Comput., vol. C-36, pp. 201-211, Feb. 1987.
[19] H. K. Reghbati, "Fault detection in PLA's,"IEEE Design Test Comput., vol. 3, pp. 43-50, Dec. 1986.
[20] J. E. Smith, "Detection of faults in programmable logic arrays,"IEEE Trans. Comput., vol. C-28, pp. 845-853, Nov. 1979.
[21] R.-S. Wei and A. Sangiovanni-Vincentelli, "Platypus: A PLA Test Pattern Generation Tool,"Proc. Design Automation Conf., June 1985, pp. 197-203.

Index Terms:
complexity; minimum test sets; monotone combinational circuits; minimum complete test set; monotone PLAs; literals; NP-complete; combinatorial circuits; computational complexity; logic arrays; logic testing.
S. Chakravarty, H.B. Hunt, III, S.S. Ravi, D.J. Rosenkrantz, "The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits," IEEE Transactions on Computers, vol. 38, no. 6, pp. 865-869, June 1989, doi:10.1109/12.24296
Usage of this product signifies your acceptance of the Terms of Use.