Practical First-Order Temporal Reasoning

C. Dixon, Michael Fisher, B. Konev, A. Lisitsa
{"title":"Practical First-Order Temporal Reasoning","authors":"C. Dixon, Michael Fisher, B. Konev, A. Lisitsa","doi":"10.1109/TIME.2008.15","DOIUrl":null,"url":null,"abstract":"In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification.","PeriodicalId":142549,"journal":{"name":"2008 15th International Symposium on Temporal Representation and Reasoning","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 15th International Symposium on Temporal Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2008.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification.
实用一阶时间推理
本文考虑了用时间逻辑来描述和验证无限状态系统。特别是,我们使用一种新的一阶时间逻辑来描述参数化系统,这种逻辑对于这种形式的说明来说足够强大,并且对于实际的演绎验证来说足够容易处理。重要的是,时态语言的强大功能允许我们描述(并验证)异步系统、通信延迟以及更复杂的活动性和公平性属性。对于许多其他的无限状态验证方法来说,这些方面显得很困难。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信