摘要
本文以边界扫描测试的布尔矩阵描述模型为基础,证明了边界扫描测试生成的两个一般性定理。其中,定理一给出了能检测所有故障的测试矩阵的紧凑性条件,定理二给出了能隔离所有故障的测试矩阵的完备性条件。以定理为基础,提出了两种边界扫描测试生成的一般性策略,为进一步研究边界扫描测试生成优化算法奠定了理论基础。
Based on the Boolean matrix model of boundary test, two fundamental theorems are proved in this paper, which determine the general conditions for test matrix generation process in boundary scan. The first theorem, the compactness theorem of boundary scan, determines the minimum size of the test matrix which can detect all the faults. The second theorem, the completeness theorem of boundary scan, determines the size of the test matrix which can isolate all the faults without bias and confusion. Furthermore, two basic test generation approaches are proposed, which can be used in developing test generation algorithms with better properties.
出处
《工程数学学报》
CSCD
北大核心
2008年第2期204-210,共7页
Chinese Journal of Engineering Mathematics
关键词
可测试性
边界扫描
测试生成
布尔矩阵
testability
boundary scan
test generation
Boolean matrix
