On testing hierarchies for protocols

The authors consider a protocol specification represented as a fully specified Mealy automata, and the problem of testing an implementation for conformance to such a specification. No single sequence-based test can be completely reliable, if one allows for the possibility of an implementation with an unknown number of extra states. They define a hierarchy of test sequences, parameterized by the length of behaviors under test. For the reset method of conformance testing, they prove that the hierarchy has the property that any fault detected by test i is also detected by test i+1, and show that this sequence of tests converges to a reliable conformance test. For certain bridge sequence methods for constructing test sequences, this result does not always hold. In experiments with several specifications, they observe that given a small number of extra states in an implementation, the sequence of tests converge to a total fault coverage for small values of i, for both reset and bridge sequence methods. They also observe that the choice of characterizing sequence has less effect on fault coverage than the choice of behavior length or number of extra states in the implementation     

Structural analysis of protocol specifications and generation ofmaximal fault coverage conformance test sequences

A theoretical analysis of the fault coverage of conformance test sequences for communication protocols specified as finite state machines is presented. Faults of different types are considered, and their effect on testing is analyzed. The interaction between faults of different categories and the impact it has on conformance testing is investigated. Fault coverage is defined for the testing of both incompletely-specified machines (ISMs) and completely-specified machines (CSMs). An algorithm is presented to generate test sequences with maximal fault coverage for the testing of ISMs. It is then augmented for the testing of CSMs, and finally a technique is presented for generating test sequences which provides guaranteed maximal fault coverage for the conformance testing of communication protocols     

Probabilistic testing of OSI protocols

Protocols are large and complex software systems. Complete conformance testing of an implementation against its standard may not be feasible in terms of the resources available. This paper discusses a new approach, the P-method, to the testing of meaningful subsets of communication protocols for an asynchronous model of communication. The approach is based on the probabilistic verification of protocols, which is carried out on the more probable part of the protocol first. The technique can be used for generating probabilistic test sequences for the conformance testing of communication protocols to standards. The proposed method yields meaningful protocol test sequences which test the most probable behaviors of a protocol when the testing of the complete protocol is not feasible. Probabilistic test sequences can be categorized into different classes. The higher the class a probabilistic test sequence is in, the larger the extent of the protocol it covers, and the better is the fault coverage. If the class of a test sequence is high enough, its fault coverage is comparable to the fault coverage of test sequences generated by other methods. Results from a study of the P-method, using alternating bit protocol (ABP) and a subset of NBS TP4 as examples, support the claims above. It can also be shown that if errors are introduced only to the more probable part of the protocol, the fault coverage of P-method is also comparable to other methods     

基于改进FSM的协议一致性测试方法

介绍了一种基于FSM(finite state machine)的生成一致性测试序列的改进算法,该方法混合了UIO(unique input/output)方法和T方法,UIO方法的测试能力优于T方法,但是生成的测试序列的长度较后者要长一些。实验结果表明,本改进方法的能力与UIO方法相同,并且测试序列的长度接近于T方法。     

Optimal length test sequence generation using distinguishingsequences

The optimization of the length of test sequences for finite state machine based protocol conformance testing is studied. The study focuses on test generation methods, called D-methods, that utilize distinguishing sequences in the construction of test segments. The extent of the optimization of the length of a test sequence is investigated with respect to two cases. The first case establishes the lower bound for the length of test sequences generated by any D-method that overlaps test segments. The second case establishes the lower bound for the length of test sequences generated by any D-method that does not overlap test segments. It is observed that the reduction in the length of test sequences due to overlapping is significant. An efficient algorithm for the generation of test sequences is proposed. This algorithm utilizes a distinguishing sequence and overlaps test segments. Sufficiency conditions are given both for finding a minimum- length test sequence in polynomial time and for constructing the optimal length test sequences by this algorithm     

基于UIO的协议一致性测试序列生成方法改进

在协议一致性测试中关键则在于寻找一条简捷高效的测试序列。在基于UIO序列的基础上提出BUIO序列的方法,并运用中国邮递员算法和启发式算法对其进行优化。     

一种可变测试集的协议一致性测试方法

目前常用的协议一致性测试的测试方法是首先对协议规范建模,然后通过模型生成测试集,最后执行测试集.这种方法存在执行效率不高和实际测试范围可能被缩小的问题,为此本文提出一种可变测试集的方法,通过动态执行测试集提高其执行效率,同时从与协议实现无关的角度扩大协议的实际测试范围.     

An optimization technique for protocol conformance test generationbased on UIO sequences and rural Chinese postman tours

A method for generating test sequences for checking the conformance of a protocol implementation to its specification is described. A rural Chinese postman tour problem algorithm is used to determine a minimum-cost tour of the transition graph of a finite-state machine. It is shown that, when the unique input/output sequence (UIO) is used in place of the more cumbersome distinguishing sequence, both the controllability and observability problems of the protocol testing problem are addressed, providing an efficient method for computing a test sequence for protocol conformance testing     

利用半可控接口进行通信协议一致性测试

介绍了一种基于半可控接口的图转换算法，并应用于某通信产品的H．245协议一致性测试中，不仅增加了可测试转换的数目，还使得变换后的EFSM可以直接应用传统的测试序列生成方法产生最优的测试序列，错误覆盖率和测试效率都得到了显著的提高。     

用于协议一致性测试序列生成的状态规范化算法

这篇论文提出了一种方法，把ＥＦＳＭ描述协议的广泛性和ＦＳＭ测试序列生成方法的成熟性有机的结合起来，较圆满地解决了测试序列的可执行性、观察性、控制性问题，同时兼顾了数据流和控制流的全面测试。这种方法是基于两边靠拢的思想，一方面将非确定性的ＥＦＳＭ向确定性的ＤＦＳＭ规范化，另一方面修改ＦＳＭ的测试序列生成算法，使之能够同时测试数据流，也即能够处理输入、输出原语的参数问题。在本文中讲述了第一步的工作，提出了由ＥＦＳＭ到ＤＦＳＭ的规范化算法和其概念的严格定义，建立了用于算法描述和实现的ＥＦＳＭ向图概念。同时选择了一个较能完全体现ＥＦＳＭ特点的Ｑ．９２１协议讲述了其实现     

TMN管理信息模型一致性测试抽象测试方法的研究

本文介绍了TMN管理信息模型一致性测试的基本概念,提出TMN管理信息模型一致性的基本参考模型。并在此基本参考模型的指导下,讨论了管理信息模型一致性测试的环境,提出TMN管理信息模型一致性测试的抽象测试方法。     

Protocol conformance testing using multiple UIO sequences

Automatic generation of conformance test sequences for communication protocols by means of unique input/output (UIO) sequences is addressed. It is shown that if multiple minimum-length UIO sequences are computed for each state of the finite-state-machine (FSM) specification, then the length of the resulting test sequence is significantly reduced without an appreciable increase in the time needed to compute the sequence. An algorithm for assignment of the multiple UIO sequences is given. This algorithm, which is based on network flow, is polynomial in the number of states and transitions of the FSM and is effective in reducing the overall length of the test sequence     

TD-LTE终端协议一致性测试自主开发测试例的设计与实现

基于TICN语言的一致性测试原理和测试方法,针对TD-LTE终端协议一致性测试系统中无法实现个性化流程测试的问题,提出用户自主开发测试倒的方案。介绍了。TD-LTE终端一致性测试系统的软件结构。在此基础上重点研究了基于IBMRational Systems Tester、其他1rrCN工具、非TYCN语言和GUI的四种开发方案。通过仿真平台测试表明,个性化流程方案设计合理。     

INAP协议一致性测试生成的形式化方法

文章应用形式化方法对INAP协议进行测试，基于INAP协议描述的I／O FSM模型，应用UIO方法生成一致性测试序列，然后应用中国乡村邮递员算法对测试序列进行优化，生成的测试序列可以覆盖状态机的每个变迁，且生成的测试序列较短。     

构建AVS标准符合性测试系统——推动AVS标准产业化

AVS国家标准第2部分视频已经发布实施，其他部分正在制定或即将发布，而标准符合性检测是保证AVS标准顺利实施、促进AVS产业化并规范市场的重要手段。围绕已经发布的AVS视频标准。对AVS符合性测试方法进行了初步的研究并对搭建符合性测试系统所需资源进行了论述。     

On the generation of minimal-length conformance tests forcommunication protocols

A technique for generating a test sequence for conformance testing of communication protocols is presented. This approach shows that it is possible to generate optimal-length test sequences which include multiple unique input/output (UIO) sequences and overlapping under certain conditions. In the absence of the above-mentioned conditions, a heuristic technique is used to obtain suboptimal solutions which show significant improvement over optimal solutions without overlapping. The technique is illustrated by the example of the NBS Class 4 Transport Protocol (TP4). The computational complexity of the algorithm is compared with that of previous techniques. A brief discussion of bounds on test sequence length is presented, and the results are compared with these bounds     

基于TTCN的测试执行方法及其应用

测试执行是协议一致性测试系统中的主要部分，本文提出一种基于测试描述语言ＴＴＣＮ的操作语义对标准测试集进行了解释执行的测试执行方法，利用这种方法所实现的一致性测试系统具有很强的灵活性和独立性，同时大大提高了测试的效率，另外，我们还介绍了基于这种测试方法所完成的协议一致性测试系统（ＰＣＴＳ）的总体结构，设计思想以及测试配置。     

Evaluation and improvement of fault coverage of conformance testingby UIO sequences

The fault coverage of testing protocols using unique input/output (UIO) sequences is analyzed. UIO sequences can be efficiently employed in checking the conformance specifications of protocols by using transition testing. The test sequence is found using the rural Chinese postman tour algorithm. A comprehensive fault model is developed, and analytical expressions are given for the fault coverage. The conditions for undetectability are analyzed, and a new algorithm is proposed. Simulation results and illustrative examples are presented. Overhead issues are discussed, and significant improvements are shown for achieving 100% fault coverage. The major advantage of the proposed approach is that it provides the theoretical basis for fault coverage evaluation of protocol testing using UIO sequences     

藏文软件标准符合性检测的研究与设计

软件产品的标准符合性检测是衡量产品质量与性能的重要方法.从藏文信息处理标准角度出发,分析与总结了藏文标准符合性检测的含义与检测内容.针对Windows操作系统产品的通用模块,分别设计了实施藏文编码字符集标准、字型标准与键盘布局标准符合性检测的具体内容、检测流程与检测算法.