Ole Lübke, S. Schupp
{"title":"WCET-aware reachability for verified simplex design: work-in-progress","authors":"Ole Lübke, S. Schupp","doi":"10.1145/3477244.3477613","DOIUrl":null,"url":null,"abstract":"Previous online reachability algorithms for hybrid automata reduced conservatism in verified Simplex controller architectures, but were restricted to the imprecise real-time paradigm, i.e., their precision increases over time. Yet, many safety-critical cyber-physical systems are hard real-time systems, requiring an upper bound on the worst-case execution time (WCET) of each task to be known. We show that the iteration bound of the reachability loop can be parameterized by a single factor which determines the precision. Consequently, an algorithm could select a fixed precision depending on the time left until its deadline. In this paper we present such a WCET-aware reachability algorithm, based on an existing algorithm for imprecise real-time. Its smallest WCET bound on an Infineon XMC4500 microprocessor is 32.861 milliseconds.","PeriodicalId":354206,"journal":{"name":"Proceedings of the 2021 International Conference on Embedded Software","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 International Conference on Embedded Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3477244.3477613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

先前用于混合自动机的在线可达性算法在经过验证的单纯形控制器架构中降低了保守性,但仅限于不精确的实时范式,即它们的精度随着时间的推移而增加。然而,许多安全关键型网络物理系统是硬实时系统,需要知道每个任务的最坏情况执行时间(WCET)的上限。我们证明了可达循环的迭代界可以由决定精度的单个因素参数化。因此,算法可以根据距离截止日期的剩余时间选择固定的精度。本文在现有非精确实时算法的基础上,提出了一种wcet感知的可达性算法。其在英飞凌XMC4500微处理器上的最小WCET值为32.861毫秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
WCET-aware reachability for verified simplex design: work-in-progress
Previous online reachability algorithms for hybrid automata reduced conservatism in verified Simplex controller architectures, but were restricted to the imprecise real-time paradigm, i.e., their precision increases over time. Yet, many safety-critical cyber-physical systems are hard real-time systems, requiring an upper bound on the worst-case execution time (WCET) of each task to be known. We show that the iteration bound of the reachability loop can be parameterized by a single factor which determines the precision. Consequently, an algorithm could select a fixed precision depending on the time left until its deadline. In this paper we present such a WCET-aware reachability algorithm, based on an existing algorithm for imprecise real-time. Its smallest WCET bound on an Infineon XMC4500 microprocessor is 32.861 milliseconds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信