An efficient verification procedure supporting evolution of reactive system specifications

T. Aoshima, Kenji Sakuma, N. Yonezaki
{"title":"An efficient verification procedure supporting evolution of reactive system specifications","authors":"T. Aoshima, Kenji Sakuma, N. Yonezaki","doi":"10.1145/602461.602505","DOIUrl":null,"url":null,"abstract":"To evolve reactive system specifications, it is necessary to check properties of the specifications, such as satisfiability, stepwise satisfiability and strong satisfiability. We developed a verification method for checking these properties of specifications described in Linear Temporal Logic. The most significant problem of the verification is that it needs huge computational resources. To solve the problem, we introduce an efficient procedure for checking these properties based on a tableau method using combination of Binary Decision Diagrams representing sets of states and coarse graphs representing transitions.","PeriodicalId":321820,"journal":{"name":"International Workshop on Principles of Software Evolution","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Principles of Software Evolution","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/602461.602505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

To evolve reactive system specifications, it is necessary to check properties of the specifications, such as satisfiability, stepwise satisfiability and strong satisfiability. We developed a verification method for checking these properties of specifications described in Linear Temporal Logic. The most significant problem of the verification is that it needs huge computational resources. To solve the problem, we introduce an efficient procedure for checking these properties based on a tableau method using combination of Binary Decision Diagrams representing sets of states and coarse graphs representing transitions.
一个有效的验证过程,支持反应式系统规范的演进
为了发展反应性系统规范,需要检查规范的性质,如可满足性、逐步可满足性和强可满足性。我们开发了一种验证方法来检查线性时序逻辑中描述的规范的这些属性。验证的最大问题是需要大量的计算资源。为了解决这个问题,我们引入了一种有效的方法来检查这些属性,该方法基于表法,使用表示状态集的二元决策图和表示转换的粗图的组合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信