Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems

Stefan Ratschan
{"title":"Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems","authors":"Stefan Ratschan","doi":"10.1145/1577190.1577195","DOIUrl":null,"url":null,"abstract":"Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Already now, more or less no new consumer device or industrial machinery does not have some form of integrated computation. Since such systems not only interact with each other, but also with humans, their malfunction can endanger human life, and hence it is essential for them to work correctly. Important examples of properties that are used for specifying system correctness are:\n \" Safety: The system state always stays in a certain set considered to be safe.\n \" Progress: The system state will eventually reach some set considered to be desirable.\n It is important to notice that here we deal with nondeterministic systems: They do not possess a single initial state, but an uncountable set of initial states, and for a given state, further evolution of a system is not fixed but, in general, there are uncountably many further evolutions.\n So, when we want to automatically verify the correctness of such systems, due to this non-determinism, we need some form of global reasoning and a form of representing the above uncountable sets. Or, in other words, we need symbolic computation.\n Considering the two aspects of CPS, computation and physical processes, the first aspect is based on computer programs, which are fixed abstract objects. Hence, for analyzing pure software systems, classical symbolic computation is the natural candidate. However, the second aspect, physical processes, is prone to perturbations, whose analysis is one of the main tasks of numerical analysis.\n As a consequence, for analyzing cyber-physical systems, we need global reasoning in the presence of perturbations, or in other words, symbolic-numeric computation. In the talk we will discuss the problem of computing with the resulting symbolic objects, and their usage in algorithms for the automatic analysis and verification of cyber-physical systems.\n The talk will draw on joint work with Zhikun She, Tomáš Dzetkulič and many others.","PeriodicalId":308716,"journal":{"name":"Symbolic-Numeric Computation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symbolic-Numeric Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1577190.1577195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Already now, more or less no new consumer device or industrial machinery does not have some form of integrated computation. Since such systems not only interact with each other, but also with humans, their malfunction can endanger human life, and hence it is essential for them to work correctly. Important examples of properties that are used for specifying system correctness are: " Safety: The system state always stays in a certain set considered to be safe. " Progress: The system state will eventually reach some set considered to be desirable. It is important to notice that here we deal with nondeterministic systems: They do not possess a single initial state, but an uncountable set of initial states, and for a given state, further evolution of a system is not fixed but, in general, there are uncountably many further evolutions. So, when we want to automatically verify the correctness of such systems, due to this non-determinism, we need some form of global reasoning and a form of representing the above uncountable sets. Or, in other words, we need symbolic computation. Considering the two aspects of CPS, computation and physical processes, the first aspect is based on computer programs, which are fixed abstract objects. Hence, for analyzing pure software systems, classical symbolic computation is the natural candidate. However, the second aspect, physical processes, is prone to perturbations, whose analysis is one of the main tasks of numerical analysis. As a consequence, for analyzing cyber-physical systems, we need global reasoning in the presence of perturbations, or in other words, symbolic-numeric computation. In the talk we will discuss the problem of computing with the resulting symbolic objects, and their usage in algorithms for the automatic analysis and verification of cyber-physical systems. The talk will draw on joint work with Zhikun She, Tomáš Dzetkulič and many others.
网络物理系统自动分析与验证中的符号-数值问题
信息物理系统(CPS)是计算和物理过程的集成。现在,几乎没有新的消费设备或工业机械没有某种形式的集成计算。由于这些系统不仅与彼此相互作用,而且与人类相互作用,因此它们的故障可能危及人类的生命,因此它们的正常工作至关重要。用于指定系统正确性的属性的重要示例有:“安全性:系统状态始终保持在被认为是安全的某个集合中。”进展:系统状态最终将达到被认为是理想的某个集合。重要的是要注意,这里我们处理的是不确定性系统:它们不具有单一的初始状态,而是具有不可数的初始状态集合,并且对于给定的状态,系统的进一步演化不是固定的,但通常存在不可数的许多进一步演化。因此,当我们想要自动验证这些系统的正确性时,由于这种非确定性,我们需要某种形式的全局推理和表示上述不可数集合的形式。换句话说,我们需要符号计算。考虑到CPS的计算和物理过程两个方面,第一个方面是基于计算机程序,它是固定的抽象对象。因此,对于分析纯软件系统,经典符号计算是自然的候选者。然而,第二个方面,物理过程,容易受到扰动,其分析是数值分析的主要任务之一。因此,为了分析网络物理系统,我们需要在扰动存在的情况下进行全局推理,或者换句话说,符号-数值计算。在讲座中,我们将讨论计算产生的符号对象的问题,以及它们在网络物理系统自动分析和验证算法中的使用。这次谈话将涉及与佘志坤、Tomáš dzetkulinik和其他许多人的共同工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信