Quantitative verification of learning-enabled systems using ProbStar reachability

IF 3.7 2区 计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS
Yuntao Li , Sung Woo Choi , Hideki Okamoto , Bardh Hoxha , Georgios Fainekos , Hoang-Dung Tran
{"title":"Quantitative verification of learning-enabled systems using ProbStar reachability","authors":"Yuntao Li ,&nbsp;Sung Woo Choi ,&nbsp;Hideki Okamoto ,&nbsp;Bardh Hoxha ,&nbsp;Georgios Fainekos ,&nbsp;Hoang-Dung Tran","doi":"10.1016/j.nahs.2025.101623","DOIUrl":null,"url":null,"abstract":"<div><div>Deep neural networks (DNN) verification primarily focuses on <em>qualitative verification</em>, determining whether a DNN violates safety or robustness properties. This paper introduces a novel approach for <em>quantitative verification</em> of Feedforward Neural Networks (FFNN), transforming qualitative assessments into probabilistic evaluations. The resulting quantitative verification method not only can answer YES or NO questions but also can compute the probability of a property being violated. To do that, we introduce the concept of a probabilistic star (or shortly ProbStar), a new variant of the well-known star set, in which the predicate variables belong to a Gaussian distribution. We further propose an approach to compute the probability of a probabilistic star in high-dimensional space. Unlike existing works dealing with constrained input sets, our work considers the input set as a truncated multivariate normal (Gaussian) distribution, i.e., besides the constraints on the input variables, the input set has a probability of the constraints being satisfied. The input distribution is represented as a probabilistic star set and propagates through a network to construct the output reachable set containing multiple ProbStars, which are used to verify the safety or robustness properties of the network. In case a property is violated, the violation probability can be computed precisely by an exact verification algorithm or approximately by an over-approximate verification algorithm. Building on this foundation, we extend our quantitative verification framework to Learning-Enabled Cyber-Physical Systems (Le-CPS), where a piecewise linear FFNN controls a linear physical plant model. Our approach enables the construction of probabilistic reachable sets for Le-CPS, allowing for both qualitative Safe/Unsafe assessments and quantitative probability computations of property violations. We have implemented our verification framework in a tool named <em>StarV</em> and evaluated its effectiveness on benchmarks including HorizontalCAS and ACASXu networks, a rocket landing system, as well as advanced emergency braking and adaptive cruise control systems within the Le-CPS domain.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101623"},"PeriodicalIF":3.7000,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Nonlinear Analysis-Hybrid Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1751570X25000494","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Deep neural networks (DNN) verification primarily focuses on qualitative verification, determining whether a DNN violates safety or robustness properties. This paper introduces a novel approach for quantitative verification of Feedforward Neural Networks (FFNN), transforming qualitative assessments into probabilistic evaluations. The resulting quantitative verification method not only can answer YES or NO questions but also can compute the probability of a property being violated. To do that, we introduce the concept of a probabilistic star (or shortly ProbStar), a new variant of the well-known star set, in which the predicate variables belong to a Gaussian distribution. We further propose an approach to compute the probability of a probabilistic star in high-dimensional space. Unlike existing works dealing with constrained input sets, our work considers the input set as a truncated multivariate normal (Gaussian) distribution, i.e., besides the constraints on the input variables, the input set has a probability of the constraints being satisfied. The input distribution is represented as a probabilistic star set and propagates through a network to construct the output reachable set containing multiple ProbStars, which are used to verify the safety or robustness properties of the network. In case a property is violated, the violation probability can be computed precisely by an exact verification algorithm or approximately by an over-approximate verification algorithm. Building on this foundation, we extend our quantitative verification framework to Learning-Enabled Cyber-Physical Systems (Le-CPS), where a piecewise linear FFNN controls a linear physical plant model. Our approach enables the construction of probabilistic reachable sets for Le-CPS, allowing for both qualitative Safe/Unsafe assessments and quantitative probability computations of property violations. We have implemented our verification framework in a tool named StarV and evaluated its effectiveness on benchmarks including HorizontalCAS and ACASXu networks, a rocket landing system, as well as advanced emergency braking and adaptive cruise control systems within the Le-CPS domain.
使用ProbStar可达性对可学习系统进行定量验证
深度神经网络(DNN)验证主要侧重于定性验证,确定DNN是否违反了安全性或鲁棒性。本文介绍了一种前馈神经网络(FFNN)定量验证的新方法,将定性评估转化为概率评估。由此产生的定量验证方法不仅可以回答YES或NO问题,还可以计算属性被侵犯的概率。为了做到这一点,我们引入了概率星(ProbStar)的概念,这是众所周知的星集的一种新变体,其中谓词变量属于高斯分布。我们进一步提出了一种计算高维空间中概率星的概率的方法。与现有处理约束输入集的工作不同,我们的工作将输入集视为截断的多元正态(高斯)分布,即,除了对输入变量的约束外,输入集具有满足约束的概率。输入分布被表示为一个概率星集,并通过网络传播,以构建包含多个ProbStars的输出可达集,这些ProbStars用于验证网络的安全性或鲁棒性。在违反属性的情况下,违反概率可以通过精确验证算法精确计算,也可以通过过近似验证算法近似计算。在此基础上,我们将定量验证框架扩展到支持学习的网络物理系统(Le-CPS),其中分段线性FFNN控制线性物理工厂模型。我们的方法能够构建Le-CPS的概率可达集,允许对财产侵犯进行定性安全/不安全评估和定量概率计算。我们已经在一个名为StarV的工具中实现了我们的验证框架,并在基准测试中评估了其有效性,包括HorizontalCAS和ACASXu网络,一个火箭着陆系统,以及Le-CPS领域的先进紧急制动和自适应巡航控制系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Nonlinear Analysis-Hybrid Systems
Nonlinear Analysis-Hybrid Systems AUTOMATION & CONTROL SYSTEMS-MATHEMATICS, APPLIED
CiteScore
8.30
自引率
9.50%
发文量
65
审稿时长
>12 weeks
期刊介绍: Nonlinear Analysis: Hybrid Systems welcomes all important research and expository papers in any discipline. Papers that are principally concerned with the theory of hybrid systems should contain significant results indicating relevant applications. Papers that emphasize applications should consist of important real world models and illuminating techniques. Papers that interrelate various aspects of hybrid systems will be most welcome.
×
引用
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学术官方微信