检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学技术大学计算机科学与技术学院,合肥230027
出 处:《计算机系统应用》2011年第7期47-52,共6页Computer Systems & Applications
基 金:国家自然科学基金(60872009);国家高技术研究发展计划(863)(2009AA01Z148);安徽高校省级自然科学研究计划(ZD2008005-2;ZD200904;JK2009A013;JK2009A025)
摘 要:基于UIO序列提出了一种新的协议一致性测试生成方法——路径叠加方法。其核心思想是寻找有限状态机中无重复转换的路径作为路径叠加转换序列,在其后连接该序列尾状态的UIO序列,从而验证该序列中所有转换。理论与实验结果表明,由路径叠加算法生成的测试序列长度要比其他基于UIO序列的算法生成的测试序列明显缩短。特别的,利用路径叠加转换序列来替代OUIO方法中对子序列直接叠加而生成的完全叠加转换序列,在检错性不降低的前提下,大大降低了叠加计算的复杂度。A new formal method named path overlapped method is proposed for protocol conformance test generation based on UIO sequences.The main idea is to find a path without repeating transition in FSM as a POTS(path overlapped transition sequence),which is a sequence of distinct transitions such that if it is followed by a UIO sequence for the end state of the last transition in the sequence then all the transitions in the sequence are verified.According to the theoretical and experimental results,the test sequences generated by the path overlapped method are substantially shorter than those generated by other methods employing UIO sequences.Particularly,because of employing path overlapped transition sequence as a substitute for FOTS(fully overlapped transition sequence) in OUIO,generation time of overlapped sequence is greatly decreased.
关 键 词:UIO序列 路径叠加转换序列 协议一致性测试 有限状态机
分 类 号:TP393.04[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15