BDL模型到UML状态图的可视化方法研究

来源 :2014全国理论计算机科学学术年会 | 被引量 : 0次 | 上传用户:tekken1981
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
针对复杂软件系统需求模型难以理解的问题,提出了一种UML状态图描述需求模型的可视化方法.该方法基于行为描述语言(Behavior Description Language,BDL)构建的需求模型,通过定义映射规则,将BDL模型中的行为、行为间关系与UML状态图中的迁移关联;将行为执行后产生的状态与UML状态图中状态关联.然后根据转换算法自动提取各结点信息,输出完整的状态图,实现BDL需求模型的可视化.最后通过实例,验证了该方法的有效性.
其他文献
An L(2,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertices get numbers at least two apart,and vertices at distance two get distinct numbe
We investigate the unbalanced cut problems.A cut (A;B) is called unbalanced if the size of its smaller side is at most k (called k-size) or exactly k (called Ek-size),where k is an input parameter.An
会议
To solve the security problems in single-cloud storage,multi-cloud storage system has been put forward in some literatures.However,when using multi-cloud,a user needs to be authenticated by different
It is crucial for synonym substitution-based steganographic algorithms to choose a suitable coding strategy for high embedding capacity.In this paper,three existing coding strategies are discussed in
Three-dimensional image registration of CT and MRI of human knees facilitates the construction of high-quality models providing the features of both modalities.This multi-modal image registration prob
K-anonymity privacy model is a typical model to protect privacy when disseminating data involving individual subjects.The drawback of k-anonymity is that generalization will result in considerable los
Feature selection method is very important for text categorization.In this paper,several classic feature selection methods are analyzed and their defficiencies are summarized firstly,and then a new fe
In the rigid-fluid coupling scenarios,rigid body sampling plays an important role on the authenticity of the simulation.The sampling method usually used is not uniform,and the effect is not ideal.This
Mobile devices in Opportunistic Networks are used and carried by people,whose social behaviors and characteristics can greatly improve the routing performance.However,most routing protocols resort mer
We consider the path cover problem which is to find a set of vertex-disjoint paths for a simple undirectedgraph with maximum number of edges to cover all vertices of this graph.The path cover problem