| 利用逆向判定性缩短EFSM的测试序列的长度 |
| |
| 引用本文： | 周晓煜,屈玉贵,赵保华.利用逆向判定性缩短EFSM的测试序列的长度[J].通信学报,2000,21(11):48-55. |
| |
| 作者姓名： | 周晓煜 屈玉贵 赵保华 |
| |
| 作者单位： | 中国科技大学,计算机系,安徽,合肥,230027 |
| |
| 基金项目： | 国家 8 6 3计划资助!项目 ( 86 3- 30 0 - 0 2 - 0 8- 99，86 3- 317- 0 4 - 16 - 99)，博士点基金资助项目 |
| |
| 摘 要： | 在一个以扩展的有限状态机（ＥＦＳＭ）为模型描述的协议测试系统中，测试序列的可执行性是一个重要的问题。同时，还要考虑到测试序列的优化问题。文中以ＥＦＳＭ为协议的描述模型，引入了逆向判定性的概念，并利用这一概念对转换可执行性分析（ＴＥＡ）方法进行了改进，缩短了生成的测试序列的长度，并且减小了所需的ＴＥＡ树扩展空间。
|
| 关 键 词： | EFSM 逆向判定性 测试序列 |
| 修稿时间： | 2000-04-06 |
Using invertibility to reduce the length of test sequences in EFSM model |
| |
| ZHOU Xiao-yu,QU Yu-gui,ZHAO Bao-hua.Using invertibility to reduce the length of test sequences in EFSM model[J].Journal on Communications,2000,21(11):48-55. |
| |
| Authors: | ZHOU Xiao-yu QU Yu-gui ZHAO Bao-hua |
| |
| Abstract: | In a protocol testing system specified in Extended Finite State Machine (EFSM) model,the executability of the test sequences is a very important issue And the optimization of the test sequences also needs to be considered In this paper,the system is specified in EFSM model The concept of invertibility is introduced and used to optimize the transition executability analysis (TEA) method,so that shorter test sequences can be generated and smaller space is needed to generate the TEA tree |
| |
| Keywords: | protocol testing executable unique input output(UIO E) invertible transition extended finite state machine (EFSM) transition executability analysis (TEA) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
