一种互操作测试的建模及测试选择方法  

A Method for Modeling and Test Selection of Interoperability

作　　者：李华[1] 叶新铭[1] 吴承勇[1] 王龙[1] 王玲玲[1] 

机构地区：[1]内蒙古大学计算机学院呼和浩特010021

出　　处：《计算机研究与发展》2009年第6期913-919,共7页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(60863015);内蒙古自治区自然科学基金重点项目(200711020803,20080404ZD20);中欧联合项目(GO4IT)~~

摘　　要：互操作性测试可以对设备互连互通互操作提供根本保证,一致性测试与互操作性测试既有相交的部分又各有不同.互操作性测试包括两个被测实现,其中一方有时称为QE(qualified equipment).根据被测的规范说明的不确定有限状态机模型和当前已有的互操作性测试经验构建概率不确定有限状态机,有效地刻画当前的互操作性测试状况.基于该模型采用宽度优先算法以及一定的策略生成包含所有状态的二叉树,然后基于得到的二叉树给出了包含不确定状态的互操作性测试序列的选择算法,通过示例展示了提出的算法的有效性,并以RIP协议的计数到无穷为例展示了提出的建模方法的应用.最后给出了结论以及下一步的研究工作.Interoperability testing is a basic guarantee for interconnecting network devices and transporting the information between these devices. Interoperability testing involves at least two IUTs （implementation under test）, and sometimes one of them is called QE（qualified equipment） which plays a measurement role during the testing process and can be used to verdict the other IUT＇s interoperability capability. Firstly, the content of interoperability testing of a protocol is introduced and the relation between interoperability testing and conformance testing is given. Secondly, according to the nondeterministic finite state machine of specification and the current experience of interoperability testing, a probability nondeterministic finite state machine（PNFSM） is constructed gradually. The achieved model efficiently describes the current situation of interoperability testing. Thirdly, based on PNFSM and a certain policy, a binary tree which covers all states of PNFSM is generated. The algorithms which are used to select test sequences from the binary tree are presented. The algorithms＇ validity is proved through an example and the final test sequences are listed in a table. Furthermore, the testing scenario of counting to infinite in RIP is used as an experiment to simply illuminate the modeling method. Finally, the conclusion and the research work in the future are introduced.

关 键 词：建模 互操作性 测试序列 不确定性 协议 被测实现 

分 类 号：TP393.06[自动化与计算机技术—计算机应用技术]