排序方式: 共有46条查询结果,搜索用时 328 毫秒
21.
EFSM的等价转换和通信协议一致性测试 总被引:2,自引:0,他引:2
绝大多数通信协议是以EFSM(扩展的有限状态机)来描述的。本文首先给出EFSM的形式化定义,然后提出EFSM的一种等价转换算法及其证明。通过协议转换,可以使生成一致性测试集的方法得到简化,并且生成的测试实例具备一定的诊断数据流错误的能力 相似文献
22.
23.
24.
An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models 总被引:2,自引:0,他引:2
Abdul Salam Kalaji Robert Mark Hierons Stephen Swift 《Information and Software Technology》2011,53(12):1297-1318
Context
The extended finite state machine (EFSM) is a modelling approach that has been used to represent a wide range of systems. When testing from an EFSM, it is normal to use a test criterion such as transition coverage. Such test criteria are often expressed in terms of transition paths (TPs) through an EFSM. Despite the popularity of EFSMs, testing from an EFSM is difficult for two main reasons: path feasibility and path input sequence generation. The path feasibility problem concerns generating paths that are feasible whereas the path input sequence generation problem is to find an input sequence that can traverse a feasible path.Objective
While search-based approaches have been used in test automation, there has been relatively little work that uses them when testing from an EFSM. In this paper, we propose an integrated search-based approach to automate testing from an EFSM.Method
The approach has two phases, the aim of the first phase being to produce a feasible TP (FTP) while the second phase searches for an input sequence to trigger this TP. The first phase uses a Genetic Algorithm whose fitness function is a TP feasibility metric based on dataflow dependence. The second phase uses a Genetic Algorithm whose fitness function is based on a combination of a branch distance function and approach level.Results
Experimental results using five EFSMs found the first phase to be effective in generating FTPs with a success rate of approximately 96.6%. Furthermore, the proposed input sequence generator could trigger all the generated feasible TPs (success rate = 100%).Conclusion
The results derived from the experiment demonstrate that the proposed approach is effective in automating testing from an EFSM. 相似文献25.
26.
提出用随机Petri网(SPN)模型对实时系统建模并产生测试序列的方法,该模型方便描述系统的并发、异步等行为,避免基于扩展有限状态机(FSM)或扩展有限状态机(EFSM)模型分析的不足,并可对系统模型进行性能分析.通过具体例子说明了其在实时软件中的应用. 相似文献
27.
测试用例的生成是软件测试的关键环节。本文把基于UML的规格说明和扩展的有限自动机结合起来,利用矩阵存储扩展自动机的状态和状态转换信息,用伪等价类生成树递增地生成测试用例,对类测试的测试用例自动生成作了有益的探讨 相似文献
28.
29.
可扩展有限状态机(EFSM)模型的测试用例生成包括测试路径生成和测试数据生成两部分。然而,目前针对EFSM模型的测试研究大多集中于测试路径生成。为探索路径上测试数据的自动生成,提出一种面向EFSM路径的测试数据生成方法,利用禁忌搜索(TS)策略实现了EFSM测试数据的自动生成;分析了影响EFSM测试数据生成的关键因素,并与遗传算法(GA)的生成效率进行了比较。实验结果表明:基于TS算法的EFSM模型测试数据自动生成是确实可行的,其测试生成效率相对于GA有很大提高。 相似文献
30.
UML状态图和Petri网络在类测试用例生成的应用 总被引:2,自引:0,他引:2
分析和研究UML状态图、扩展状态机和Petri网在类测试用例生成的特点,提出结合三者优势的类测试用例生成方法.通过Petri网对状态图进行性质分析可以解决状态爆炸,分析状态图冲突和了解覆盖性等问题.通过实例分析和研究,三者结合的基于完整路径转换测试准则所产生测试用例生成方法是有效的. 相似文献