验证系统受密集时间约束和概率约束

S. Yamane
{"title":"验证系统受密集时间约束和概率约束","authors":"S. Yamane","doi":"10.1109/SEEP.1996.533998","DOIUrl":null,"url":null,"abstract":"Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective.","PeriodicalId":416862,"journal":{"name":"Proceedings 1996 International Conference Software Engineering: Education and Practice","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The verification system by dense timing constraints and probabilities\",\"authors\":\"S. Yamane\",\"doi\":\"10.1109/SEEP.1996.533998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective.\",\"PeriodicalId\":416862,\"journal\":{\"name\":\"Proceedings 1996 International Conference Software Engineering: Education and Practice\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1996 International Conference Software Engineering: Education and Practice\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEEP.1996.533998\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1996 International Conference Software Engineering: Education and Practice","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEEP.1996.533998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

正式的验证和规范对于实时软件来说是非常重要的。在本文中,为了保证软件的可靠性,我们考虑了密集时序和概率的概念。在本文中,我们提出了以下方法来指定和验证密集时间模型中的性能属性。我们通过扩展具有密集时间和概率的状态图的概念,提出了一个概率密集时间状态图。我们还提出了一种概率密集时间逻辑,通过扩展TCTL(时间计算树逻辑)与概率。最后,提出了一种自动验证方法。我们已经根据所提出的方法开发了一个验证系统,并证明它是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The verification system by dense timing constraints and probabilities
Formal verification and specification are important for real-time software. In this paper, in order to maintain the reliability of the software, we consider that the notion of dense timing and probabilities are necessary. In this paper, we propose the following methods in order to specify and verify performance properties in the dense time model. We propose a probabilistic dense-time statechart by extending the concept of the statechart with dense time and probabilities. We also propose a probabilistic dense-time temporal logic by extending TCTL (timed computation tree logic) with probabilities. Finally, we propose an automatic verification method. We have developed a verification system based on the proposed method and shown it to be effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信