本論文提出一個利用統計的方法來計算出組合電路中每個節點的可測性。這個可測性分析的方法是將問題轉化為蒙地卡羅的模組來做模擬分析，透過定義模擬的條件後，蒙地卡羅的模擬能在結果達到我們事前所定義的信心水準以及誤差內停止。我們的實驗部分是使用一系列的ISCAS'85以及MCNC測資，和先前的研究相比，我們的方法更能有效的算出電路的可測性同時又有較高的準確度。

This paper presents a statistic-based approach for evaluating the testability of nodes in combinational circuits. This testability measurement is obtained via Monte Carlo simulation governed by the formulated Monte Carlo model. The Monte Carlo simulation is terminated when the predefined error with respect to the Monte Carlo model, under a specified confidence level, is achieved. We conduct the experiments on a set of ISCAS'85 and MCNC benchmarks. As compared with previous work, our approach more efficiently evaluates the testability with less error.

[1] M. Abramovici, P. R. Menon, and D. T. Miller, “Critical path tracing - an alternative to fault simulation,” in Proc. 20th Conf. on Design Automation, pp.214-220, 1983.

[2] V. D. Agrawal and S. C. Seth, “Probabilistic testability,” in Proc. Int. Conf. on Computer Design, pp.562-565, 1985.

[3] F. Brglez, “On testability of combinational networks,” in Proc.Int Symp. Circuits and Systems, pp.221-225, 1984.

[4] R. E. Bryant, “Graph-based algorithms for boolean function manipulation,” IEEE Trans. on Computers, pp.677-691, Aug. 1986.

[5] S. Chakravarty and H. B. Hunt III, “On computing signal probability and detection probability of stuck-at faults,” IEEE Trans. Comput., vol.39, pp.1369-1377, Nov. 1990.

[6] S. C. Chang, W. B. Jone and S. S. Chang, “TAIR: testability analysis by implication reasoning,” IEEE Trans. Computer-Aided Design., vol. 19, pp. 152-160, Jan. 2000.

[7] L. H. Goldstein, “Controllability/observability analysis of digital circuits,” IEEE Trans. Circuits Syst., vol. CAS-26, pp. 685-693, Sept. 1979.

[8] R. K. Gaede, M. R. Mercer, and B. Underwood, “Calculation of greatest lower bounds obtainable by the cutting algorithm,” in Proc. Int. Test Conf., pp. 498-505, 1986.

[9] S. K. Jain and V. D. Agrawal, “Statistical fault analysis,” IEEE Design Test Comput., vol. 2, pp. 38-44, Feb. 1985.

[10] I. R. Miller, J. E. Freund and R. Johnson, “Probability and statistics for engineers,” Englewood Cliffs, NJ: Prentice Hall, 1990.

[11] K. P. Parker and E. J. McCluskey, “Probabilistic treatment of general combinational networks,” IEEE Trans. Comput., vol. C-24, pp. 668-670, 1975.

[12] J. Savir, G. S. Ditlow, and P. H. Bardell, “Random pattern testability,” IEEE Trans. Comput., vol. C-33, pp. 79-90, Jan. 1984.

[13] J. Savir, “Improved cutting algorithm,” IBM J. Res. Develop., vol. 34, no. 2/3, pp. 381-388, Mar.-May 1990.

[14] E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli, “SIS: A system for sequential circuit synthesis,” Technical Report UCB/ERL M92/41, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, May 1992.

[15] S. C. Seth, L. Pan, and V. D. Agrawal, “PREDICT: Probabilistic estimation of digital circuit testability,” in Proc. 15th Int. Fault-Tolerant Computer Symp., pp. 220-225, June 1985

[16] S. C. Seth and V. D. Agrawal, “An exact analysis for efficient computation of random-pattern testability in combinational circuits,” in Proc. 16th Int. Fault-Tolerant Computer Symp., pp. 318-323, 1986.

[17] O. Song and P. R. Menon, “Parallel pattern fault simulation based on stem faults in combinational circuits,” in Proc. Int. Test Conf., pp. 706-711, 1990.

[18] H. C. Tsai, K. T. Cheng, C. J. Lin, and S. Bhawmik, “A hybrid algorithm for test point selection for scan-based BIST,” in Proc. Design Automation Conf., pp. 478-483, 1997.

[19] D. T. Wang, “An algorithm for the generation of test sets for combinational logic network,” IEEE Trans. Comput., Vol. C-24, No. 7, pp. 742-746, July 1975.

[20] http://www.swox.com/gmp