计算机应用与软件2013，Vol.30Issue(6)：202-208,7.DOI:10.3969/j.issn.1000-386x.2013.06.054
基于随机Petri网的SysML状态机图的验证
VERIFYING SYSML STATE MACHINE DIAGRAMS BASED ON STOCHASTIC PETRI NET
刘军霞 1熊选东 2王松锋2
作者信息
- 1. 河南省军区指挥自动化工作站 河南郑州450004
- 2. 解放军信息工程大学电子技术学院 河南郑州450004
- 折叠
摘要
Abstract
For solving the problem of SysML in lacking analysis and verification means by itself,this paper presents a method of converting the SysML state machine diagram to generalised stochastic Petri net,in main there are eight transformation rules defined for converting the SysML state machine diagram to corresponding executable model of Petri net.Using these transformation rules,the SysML state machine diagram can be transformed to Petri net,and then to further analyse and verify it.Besides of this,the rules can also be used to detect concurrency-related code of conduct nature,such as deadlocks,boundness,etc.At the same time,the method can handle state transition with time delay and information probability.Finally,an example of digital certificates systems is used to demonstrate the feasibility of the method.关键词
系统建模语言/随机Petri网/广义随机Petri网/状态机图/建模Key words
SysML / Stochastic Petri nets / Generalised stochastic Petri net / State machine diagram / Modelling分类
信息技术与安全科学引用本文复制引用
刘军霞,熊选东,王松锋..基于随机Petri网的SysML状态机图的验证[J].计算机应用与软件,2013,30(6):202-208,7.
