{"title":"使用ProbStar可达性对可学习系统进行定量验证","authors":"Yuntao Li , Sung Woo Choi , Hideki Okamoto , Bardh Hoxha , Georgios Fainekos , 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":"{\"title\":\"Quantitative verification of learning-enabled systems using ProbStar reachability\",\"authors\":\"Yuntao Li , Sung Woo Choi , Hideki Okamoto , Bardh Hoxha , Georgios Fainekos , 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}","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}
Quantitative verification of learning-enabled systems using ProbStar reachability
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.
期刊介绍:
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.