基于时间距离的抢占式实时系统DBM过逼近计算

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Abdelkrim Abdelli
{"title":"基于时间距离的抢占式实时系统DBM过逼近计算","authors":"Abdelkrim Abdelli","doi":"10.1016/j.jlamp.2023.100927","DOIUrl":null,"url":null,"abstract":"<div><p>The verification of preemptive real-time systems is a crucial aspect in ensuring their correctness and reliability to meet strict time constraints. Generally, the analysis of the behaviors of such systems requires the computation of the reachability graphs encoding their state space. However, the construction of the latter is computationally expensive and resource-consuming as it involves, for each graph node, managing and solving polyhedral constraints whose complexity is exponential.</p><p>In this paper, we explore a novel approach that builds an over-approximation of the state space of preemptive real-time systems. Our graph construction extends the expression of a node to the time-distance system that encodes the quantitative properties of past-fired subsequences. This makes it possible to restore relevant time information that is used to compute in a polynomial time a tighter difference bound matrix over-approximation of the polyhedral constraints. We show that the obtained graph is more appropriate to restore the quantitative properties of the model. The simulation results show that our graphs are almost of the same size as the exact graphs, while improving by far the times needed for their computation.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"136 ","pages":"Article 100927"},"PeriodicalIF":0.7000,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Time distance-based computation of the DBM over-approximation of preemptive real-time systems\",\"authors\":\"Abdelkrim Abdelli\",\"doi\":\"10.1016/j.jlamp.2023.100927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The verification of preemptive real-time systems is a crucial aspect in ensuring their correctness and reliability to meet strict time constraints. Generally, the analysis of the behaviors of such systems requires the computation of the reachability graphs encoding their state space. However, the construction of the latter is computationally expensive and resource-consuming as it involves, for each graph node, managing and solving polyhedral constraints whose complexity is exponential.</p><p>In this paper, we explore a novel approach that builds an over-approximation of the state space of preemptive real-time systems. Our graph construction extends the expression of a node to the time-distance system that encodes the quantitative properties of past-fired subsequences. This makes it possible to restore relevant time information that is used to compute in a polynomial time a tighter difference bound matrix over-approximation of the polyhedral constraints. We show that the obtained graph is more appropriate to restore the quantitative properties of the model. The simulation results show that our graphs are almost of the same size as the exact graphs, while improving by far the times needed for their computation.</p></div>\",\"PeriodicalId\":48797,\"journal\":{\"name\":\"Journal of Logical and Algebraic Methods in Programming\",\"volume\":\"136 \",\"pages\":\"Article 100927\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logical and Algebraic Methods in Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2352220823000810\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logical and Algebraic Methods in Programming","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352220823000810","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

抢占式实时系统的验证是保证其正确性和可靠性满足严格时间约束的关键。一般来说,分析这类系统的行为需要计算编码其状态空间的可达性图。然而,后者的构建是计算昂贵和资源消耗,因为它涉及到,对于每个图节点,管理和解决复杂性指数的多面体约束。在本文中,我们探索了一种建立抢占式实时系统状态空间的过逼近的新方法。我们的图构造将节点的表达式扩展到时间距离系统,该系统编码了过去触发子序列的数量属性。这使得恢复相关的时间信息成为可能,这些信息用于在多项式时间内计算多面体约束的更严格的差分界矩阵过逼近。结果表明,得到的图更适合于恢复模型的定量性质。仿真结果表明,我们的图与精确图的大小几乎相同,同时大大提高了计算所需的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Time distance-based computation of the DBM over-approximation of preemptive real-time systems

The verification of preemptive real-time systems is a crucial aspect in ensuring their correctness and reliability to meet strict time constraints. Generally, the analysis of the behaviors of such systems requires the computation of the reachability graphs encoding their state space. However, the construction of the latter is computationally expensive and resource-consuming as it involves, for each graph node, managing and solving polyhedral constraints whose complexity is exponential.

In this paper, we explore a novel approach that builds an over-approximation of the state space of preemptive real-time systems. Our graph construction extends the expression of a node to the time-distance system that encodes the quantitative properties of past-fired subsequences. This makes it possible to restore relevant time information that is used to compute in a polynomial time a tighter difference bound matrix over-approximation of the polyhedral constraints. We show that the obtained graph is more appropriate to restore the quantitative properties of the model. The simulation results show that our graphs are almost of the same size as the exact graphs, while improving by far the times needed for their computation.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Logical and Algebraic Methods in Programming
Journal of Logical and Algebraic Methods in Programming COMPUTER SCIENCE, THEORY & METHODS-LOGIC
CiteScore
2.60
自引率
22.20%
发文量
48
期刊介绍: The Journal of Logical and Algebraic Methods in Programming is an international journal whose aim is to publish high quality, original research papers, survey and review articles, tutorial expositions, and historical studies in the areas of logical and algebraic methods and techniques for guaranteeing correctness and performability of programs and in general of computing systems. All aspects will be covered, especially theory and foundations, implementation issues, and applications involving novel ideas.
×
引用
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学术官方微信