检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学计算机科学与技术学院,江苏南京210016
出 处:《计算机技术与发展》2015年第9期31-36,共6页Computer Technology and Development
基 金:国防科工局"十二五"重大基础科研项目(c0420110005)
摘 要:系统建模语言(Systems Modeling Language,SysML)对复杂系统多视角建模时,容易造成多视图描述语义冲突、矛盾等不一致问题,可以通过形式化验证方法,来提高模型的一致性。然而,受制于传统的形式化检测方法不能做到完全自动化,并且需要繁杂的公式推理,导致多数验证方法仅限少数专家使用并且非常耗时。为了解决SysML时序图与活动图模型之间存在的一致性问题,提出一种自动转换验证框架。首先基于已构建的模型和转换规则,将时序图进行分解转换为活动图,然后分别映射为Spin的输入模型,并对模型的交互一致性执行自动化验证。实验结果表明,该方法可以有效识别和转换时序图,并能准确地向Promela实施映射和验证,为一致性验证的演化提供支持。As systems modeling language models multiple views for complex system,it can lead to a variety of inconsistent problem in the model. Formal verification methods can be used to improve consistency of the model. In the reason of that traditional formal methods can’t be complete automation and need complex formula deduction,most verification can only be used by experts and it’s very time-consuming. To address the consistent problems of the SysML sequence diagram and activity diagram,propose an automated transition and checking consistency approach. The sequence diagram can be decomposed and transformed to an activity diagram using the mapping rules. The diagrams are mapped to the input model of Spin. Then,the models are analyzed and verified by Spin. The experimental results show that the approach can correctly transform complex sequence diagrams in real projects and effectively verify consistency of them. This indicates that the approach is helpful for model checking evolution.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38