Generation algorithm of LTS state tree based on CHAM model
Jun Ye · Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University · 2003
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.