一种类间交互测试的约束型标记驱动Petri网模型  

Constraint Label-driven Petri Network Model for Classes Interaction Test

作　　者：龚红仿[1] 李军义[2] 

机构地区：[1]长沙理工大学数学与计算科学学院,湖南长沙410004 [2]湖南大学计算机与通信学院,湖南长沙410082

出　　处：《小型微型计算机系统》2010年第6期1185-1189,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(10871031)资助;湖南省科技计划项目(2008CK3075)资助

摘　　要：面向对象软件测试的主要问题是考虑类间交互的集成测试,交互测试能检查出对象间的消息传递产生的不可达路径.设计了一种约束型标记驱动Petri网(C-LDPN)模型描述对象间的消息交互,给出了UML协作图转换为C-LDPN的规则.在定义对象活跃点以及对象活跃格局概念的基础上,根据对象所关联的变迁得出对象状态集上的等价类,提出一种消除C-LDPN中分支冲突的类间交互测试用例生成算法,求出对象的每个等价类中所有的活跃点数,得出对象的总状态数,用对象的分割连接子分割对象的状态域得到可达性C-LDPN,用合并连接子合并子对象得到标准型C-LDPN,最终生成类间交互测试用例--标记-变迁路径(LTPaths).Integrating test of interclass interactions is one of the primary problems for testing object-oriented software.Some unreachable paths that are generated by message interaction among classes can be found.A model named Constraint Label-Driven Petri Network（C-LDPN）,which can show the message interaction,was proposed.A method of converting UML collaboration diagrams into C-LDPN was brought forward.The paper defined object active points and object activity configuration firstly,and described the definition of equivalence class based on the transfers associated by an object afterwards.A test cases generation technique of interclass interactions was presented to eliminate branch collision in C-LDPN.The presented algorithm can calculate the amount of active points in each equivalence class to count the all states amount of the object,and divide up the state fields of objects using fork link operators to generate reachable C-LDPN,and merge correlated subobjects using merge link operators to generate level C-LDPN.In level C-LDPN,all interactive test cases named transition-labeled paths are generated.

关 键 词：类间交互测试 对象活跃点 对象连接子 分支冲突 标记-变迁路径 约束型标记驱动Petri网 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]