共查询到20条相似文献,搜索用时 31 毫秒
1.
Synchronizable test sequences based on multiple UIO sequences 总被引:1,自引:0,他引:1
Wen-Huei Chen Hasan Urai 《Networking, IEEE/ACM Transactions on》1995,3(2):152-157
A test sequence generation method is proposed for testing the conformance of a protocol implementation to its specification in a remote testing system where both external synchronization and input/output operation costs are taken into consideration. The method consists of a set of transformation rules that constructs a duplexU digraph from a given finite state machine (FSM) representation of a protocol specification; and an algorithm that finds a rural postman tour in the duplexU digraph to generate a synchronizable test sequence utilizing multiple UIO sequences. If the protocol satisfies a specific property, namely, the transitions to be tested and the UIO sequences to be employed form a weakly-connected subgraph of the duplexU digraph, the proposed algorithm yields a minimum-cost test sequence. X.25 DTE and ISO Class 0 transport protocols are shown to possess this property. Otherwise, the algorithm yields a test sequence whose cost is within a bound from the cost of the minimum-cost test sequence. The bound for the test sequence generated from the Q.931 network-side protocol is shown to be the cost sum of an input/output operation pair and an external synchronization operation 相似文献
2.
现有Modbus协议一致性测试中尚未形成测试自动化方法,给测试的有效性和客观性带来了不利影响,为了解决这一问题,提出一致性测试的自动化方法的体系结构,它由测试用例生成器和测试结果分析器组成,然后基于体系结构实现了一致性自动化测试系统。在实际应用中该系统发现了一些隐藏的Modbus一致性问题,证明了该方法的可用性和有效性。 相似文献
3.
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 相似文献
4.
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 相似文献
5.
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 相似文献
6.
7.
8.
基于TTCN的测试执行方法及其应用 总被引:2,自引:0,他引:2
测试执行是协议一致性测试系统中的主要部分,本文提出一种基于测试描述语言TTCN的操作语义对标准测试集进行了解释执行的测试执行方法,利用这种方法所实现的一致性测试系统具有很强的灵活性和独立性,同时大大提高了测试的效率,另外,我们还介绍了基于这种测试方法所完成的协议一致性测试系统(PCTS)的总体结构,设计思想以及测试配置。 相似文献
9.
10.
以LTE(长期演进)系统RRC(无线资源控制)实现的协议一致性为目的,并结合LTE协议一致性测试的特点和实际开发经验,设计一种通过开发TTCN-3(测试和测试控制表示法版本3)测试例来验证协议一致性的新方案。并基于德国Testing Tech公司开发的TTworkbench平台运行TTCN-3测试例,自动生成GFT图(图形表示格式),有效检验了RRC层功能实现的协议一致性。目前该方案已成功应用于LTE系统TTCN扩展测试集仪表开发的项目中。 相似文献
11.
12.
13.
基于UIO的协议一致性测试序列生成方法改进 总被引:1,自引:0,他引:1
在协议一致性测试中关键则在于寻找一条简捷高效的测试序列。在基于UIO序列的基础上提出BUIO序列的方法,并运用中国邮递员算法和启发式算法对其进行优化。 相似文献
14.
15.
16.
七号信令ISUP协议的一致性测试 总被引:1,自引:0,他引:1
本文在简单描述协议一致性测试基本概念的基础上,阐述了ISUP协议一致性测试的理论和方法。详细介绍了已经研制成功的ISUP协议的一致性测试系统。 相似文献
17.
18.
19.
20.
基于TICN语言的一致性测试原理和测试方法,针对TD-LTE终端协议一致性测试系统中无法实现个性化流程测试的问题,提出用户自主开发测试倒的方案。介绍了。TD-LTE终端一致性测试系统的软件结构。在此基础上重点研究了基于IBMRational Systems Tester、其他1rrCN工具、非TYCN语言和GUI的四种开发方案。通过仿真平台测试表明,个性化流程方案设计合理。 相似文献