Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability

Alessandro Cimatti, Thomas M. Grosen, Kim G. Larsen, Stefano Tonetta, Martin Zimmermann
{"title":"Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability","authors":"Alessandro Cimatti, Thomas M. Grosen, Kim G. Larsen, Stefano Tonetta, Martin Zimmermann","doi":"arxiv-2409.05456","DOIUrl":null,"url":null,"abstract":"Runtime verification of temporal properties over timed sequences of\nobservations is crucial in various applications within cyber-physical systems\nranging from autonomous vehicles over smart grids to medical devices. In this\npaper, we are addressing the challenge of effectively predicting the failure or\nsuccess of properties in a continuous real-time setting. Our approach allows\npredictions to exploit assumptions on the system being monitored and supports\npredictions of non-observable system behaviour (e.g. internal faults). More\nconcretely, in our approach properties are expressed in Metric Interval\nTemporal Logic (MITL), assumptions on the monitored system are specified in\nterms of Timed Automata, and observations are to be provided in terms of\nsequences of timed constraints. We present an assumption-based runtime\nverification algorithm and its implementation on top of the real-time\nverification tool UPPAAL. We show experimentally that assumptions can be\neffective in anticipating the satisfaction/violation of timed properties and in\nhandling monitoring properties that predicate over unobservable events.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.05456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Runtime verification of temporal properties over timed sequences of observations is crucial in various applications within cyber-physical systems ranging from autonomous vehicles over smart grids to medical devices. In this paper, we are addressing the challenge of effectively predicting the failure or success of properties in a continuous real-time setting. Our approach allows predictions to exploit assumptions on the system being monitored and supports predictions of non-observable system behaviour (e.g. internal faults). More concretely, in our approach properties are expressed in Metric Interval Temporal Logic (MITL), assumptions on the monitored system are specified in terms of Timed Automata, and observations are to be provided in terms of sequences of timed constraints. We present an assumption-based runtime verification algorithm and its implementation on top of the real-time verification tool UPPAAL. We show experimentally that assumptions can be effective in anticipating the satisfaction/violation of timed properties and in handling monitoring properties that predicate over unobservable events.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用假设,在部分可观测性条件下有效监控实时属性
在从自动驾驶汽车到智能电网再到医疗设备的各种网络物理系统应用中,对定时观测序列的时间属性进行运行验证至关重要。在本文中,我们要解决的难题是在连续实时环境中有效预测属性的失败或成功。我们的方法允许利用被监控系统的假设进行预测,并支持预测不可观测的系统行为(如内部故障)。更具体地说,在我们的方法中,属性用公制时间间隔逻辑(MITL)来表达,被监控系统的假设用定时自动机来指定,观测结果用定时约束序列来提供。我们介绍了一种基于假设的运行时间验证算法及其在实时验证工具 UPPAAL 上的实现。我们通过实验证明,假设可以有效地预测定时属性的满足/违反情况,并处理对不可观测事件进行谓词化的监测属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1