消息路径:UML协作图的复杂性度量  

Message path: Complexity metrics about UML collaboration diagram

作　　者：范莉莉[1] 王忠群[1] 

机构地区：[1]安徽工程科技学院计算机科学与工程系,安徽芜湖241000

出　　处：《计算机工程与设计》2010年第23期5039-5042,5051,共5页Computer Engineering and Design

基　　金：安徽省自然科学基金项目(070412058);安徽工程科技学院青年基金项目(2008YQ025zd)

摘　　要：针对面向对象软件的复杂性,提出了一种面向UML协作图的软件动态复杂性度量方法——消息路径。基于UML协作图中角色对象间的消息流以及所定义的不同类别的信息标记,给出消息路径图的构造方法和基于消息路径图的面向对象软件动态复杂性度量模型。在该模型中,建立了一组复杂性度量指标,并对这些指标的意义进行了阐述。结合具体实例,给出了消息路径图和各项指标值,并且比较了不同实例的度量结果,表明了所提出度量方法的可行性和实用性。Aiming at the complexity of object-oriented software,a software dynamic complexity metrics method is introduced for UML collaboration diagram,which is named message path.Based on message flows between role objects of UML collaboration diagram and message notations described,an approach to construcing message path graph（MPG） and a model for software dynamic complexity based onMPG are presented.In the model,a set of complexity metrics indicators to analyze dynamic complexity of object-oriented software systems are established,and the meaning of these indicators are described.With specific case,the message path graph is constructed, and the values of the indicators are calculated.By comparing the metrics of two cases,the approach proposed is illustrated to be feasible and practical.

关 键 词：UML协作图 消息路径 消息路径图 动态复杂性 度量 

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