| 临界二元村临界输入的一种启发式排序方法 |
| |
| 引用本文： | 陈朝阳,陈光,虞厥邦. 临界二元村临界输入的一种启发式排序方法[J]. 电子科技大学学报(社会科学版), 1996, 0(3) |
| |
| 作者姓名： | 陈朝阳 陈光 虞厥邦 |
| |
| 作者单位： | 电子科技大学自动化系，电子科技大学光电子技术系 |
| |
| 基金项目： | 国家“八五”重点科研项目 |
| |
| 摘 要： | 临界二元树ＣＢＴ（ｃｒｉｔｉｃａｌＢｉｎａｒｙＴｒｅｅ）作为描述电路功能的一种方法，可以用于呆滞型故障模型的电路功能级测试生成。其基于知识的树结构特别适用于专家系统环境［１］。然而ＣＢＴ的大小取决于临界输入的识别，好的临界输入排序可以大大缩小ＣＢＴ规模。文中提出了一种临界输入的启发式识别方法，以求获得较小的ＣＢＴ，加速测试生成过程。
|
| 关 键 词： | 临界二元树；临界输入；启发式识别方法；功能级测试生成 |
A Heuristic Ordering Method of Critical Inputs of Critical Binary Tree |
| |
| Chen Chaoyang,Chen Guangju,Yu Juebang. A Heuristic Ordering Method of Critical Inputs of Critical Binary Tree[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 1996, 0(3) |
| |
| Authors: | Chen Chaoyang Chen Guangju Yu Juebang |
| |
| Affiliation: | Dept. of Automation. Dept. of Opto-Electronic Technology.UEST of China Chenghu 610054 |
| |
| Abstract: | Critical Binary Tree (CBT) is a functional representation scheme of circuits which may be used for circuit functional test generation based on stuck-at fault models, and its knowledge-based tree structure is especially fit for expert system environment[1]. But the size of CBT depends upon critical input identification,and may be greatly reduced by the good order of critical inputs. This paper describes a method for critical input heuristic identification, which can minimize the size of the tree and accerate the process of test generation. |
| |
| Keywords: | critical binary tree critical inputs heuristic identification method functional test generation |
| 本文献已被 CNKI 等数据库收录！ |
