摘要
标号迁移系统(labelledtransitionsystem,LTS)是形式化一致性测试的重要研究方向.在软件体系结构(softwarearchitectures,SA)测试计划生成的研究中,需要从化学抽象机(chemicalabstractmachine,CHAM)模型中生成LTS,以表达出软件体系结构的动态特征.因此,LTS状态树生成算法是导出软件测试计划和测试用例研究工作中的关键问题.基于CHAM模型,提出了通用LTS状态树生成算法,并使用实例验证了该算法.
Labelled transition system (LTS) is an important research aspect of formalization analysis. In the research of software architecture (SA) modeling, it is necessary to generate LTS from the chemical abstract machine (CHAM) model to express dynamic characters of SA and to generate testing cases. Thus, LTS state tree generation algorithm is the key to deriving testing plans and testing cases from architecture descriptions. The LTS state tree generation algorithm based on CHAM is presented, and validated with a typical in examples.
出处
《哈尔滨工程大学学报》
EI
CAS
CSCD
2003年第3期287-291,共5页
Journal of Harbin Engineering University
基金
武汉大学软件工程国家重点实验室开放基金资助项目(SKL(4)020).