用模型变换分析时序图的定性和定量

Meixia Zhu, Hanpin Wang, Yongzhi Cao, Zizhen Wang, W. Jin
{"title":"用模型变换分析时序图的定性和定量","authors":"Meixia Zhu, Hanpin Wang, Yongzhi Cao, Zizhen Wang, W. Jin","doi":"10.1109/APSEC.2010.23","DOIUrl":null,"url":null,"abstract":"The Sequence Diagram (SD) with time properties is frequently used in the preliminary developing phase of embedded real time system, however, it is not easy to verify due to its informal semantics. An extended time Petri net (TPN) with \\emph{weak} semantics–TLOPNforSD–is defined and proved to be decidable as far as reach ability, boundedness and cover ability are concerned. A method for progressively refining the SD is also offered in the transformation phase. The SD with time properties are made to be more reliable in two aspects: (1) an enabled transitions generating algorithm based on \\emph{weak} semantics is designed. Based on this algorithm, the verification of SD with time properties in qualitative aspect can be realized by dint of ROMEO, (2) using the state-class diagram obtained in qualitative analysis phase, a scheduling strategy satisfying all the time constraints specified in the SD is worked out. The strategy is used to get compelling time intervals which are more accurate than the static intervals predefined on the SD for every event.","PeriodicalId":161686,"journal":{"name":"2010 Asia Pacific Software Engineering Conference","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The Analysis of Sequence Diagram with Time Properties in Qualitative and Quantitative Aspects by Model Transformation\",\"authors\":\"Meixia Zhu, Hanpin Wang, Yongzhi Cao, Zizhen Wang, W. Jin\",\"doi\":\"10.1109/APSEC.2010.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Sequence Diagram (SD) with time properties is frequently used in the preliminary developing phase of embedded real time system, however, it is not easy to verify due to its informal semantics. An extended time Petri net (TPN) with \\\\emph{weak} semantics–TLOPNforSD–is defined and proved to be decidable as far as reach ability, boundedness and cover ability are concerned. A method for progressively refining the SD is also offered in the transformation phase. The SD with time properties are made to be more reliable in two aspects: (1) an enabled transitions generating algorithm based on \\\\emph{weak} semantics is designed. Based on this algorithm, the verification of SD with time properties in qualitative aspect can be realized by dint of ROMEO, (2) using the state-class diagram obtained in qualitative analysis phase, a scheduling strategy satisfying all the time constraints specified in the SD is worked out. The strategy is used to get compelling time intervals which are more accurate than the static intervals predefined on the SD for every event.\",\"PeriodicalId\":161686,\"journal\":{\"name\":\"2010 Asia Pacific Software Engineering Conference\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Asia Pacific Software Engineering Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSEC.2010.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Asia Pacific Software Engineering Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSEC.2010.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

时序图是嵌入式实时系统开发初期经常使用的一种具有时间属性的时序图,但由于其语义不正式,不便于验证。定义了一种\emph{弱}语义的扩展时间Petri网(TPN) - tlopnford,并证明了其在可达性、有界性和覆盖能力方面是可决定的。在转换阶段还提供了一种逐步细化SD的方法。从两个方面提高了具有时间属性的SD的可靠性:(1)设计了一种基于\emph{弱}语义的启用转换生成算法。在此基础上,借助ROMEO实现了SD在定性方面具有时间属性的验证。(2)利用定性分析阶段得到的状态类图,制定出满足SD中所有时间约束的调度策略。该策略用于获得比在SD上预定义的静态时间间隔更精确的强制时间间隔。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Analysis of Sequence Diagram with Time Properties in Qualitative and Quantitative Aspects by Model Transformation
The Sequence Diagram (SD) with time properties is frequently used in the preliminary developing phase of embedded real time system, however, it is not easy to verify due to its informal semantics. An extended time Petri net (TPN) with \emph{weak} semantics–TLOPNforSD–is defined and proved to be decidable as far as reach ability, boundedness and cover ability are concerned. A method for progressively refining the SD is also offered in the transformation phase. The SD with time properties are made to be more reliable in two aspects: (1) an enabled transitions generating algorithm based on \emph{weak} semantics is designed. Based on this algorithm, the verification of SD with time properties in qualitative aspect can be realized by dint of ROMEO, (2) using the state-class diagram obtained in qualitative analysis phase, a scheduling strategy satisfying all the time constraints specified in the SD is worked out. The strategy is used to get compelling time intervals which are more accurate than the static intervals predefined on the SD for every event.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信