Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control最新文献_第2页

Verification of Recurrent Neural Networks with Star Reachability 具有星型可达性的递归神经网络的验证

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587128

Hoang-Dung Tran, Sung-Woo Choi, Xiaodong Yang, Tomoya Yamaguchi, Bardh Hoxha, D. Prokhorov

{"title":"Verification of Recurrent Neural Networks with Star Reachability","authors":"Hoang-Dung Tran, Sung-Woo Choi, Xiaodong Yang, Tomoya Yamaguchi, Bardh Hoxha, D. Prokhorov","doi":"10.1145/3575870.3587128","DOIUrl":"https://doi.org/10.1145/3575870.3587128","url":null,"abstract":"The paper extends the recent star reachability method to verify the robustness of recurrent neural networks (RNNs) for use in safety-critical applications. RNNs are a popular machine learning method for various applications, but they are vulnerable to adversarial attacks, where slightly perturbing the input sequence can lead to an unexpected result. Recent notable techniques for verifying RNNs include unrolling, and invariant inference approaches. The first method has scaling issues since unrolling an RNN creates a large feedforward neural network. The second method, using invariant sets, has better scalability but can produce unknown results due to the accumulation of overapproximation errors over time. This paper introduces a complementary verification method for RNNs that is both sound and complete. A relaxation parameter can be used to convert the method into a fast overapproximation method that still provides soundness guarantees. The method is designed to be used with NNV, a tool for verifying deep neural networks and learning-enabled cyber-physical systems. Compared to state-of-the-art methods, the extended exact reachability method is 10 × faster, and the overapproximation method is 100 × to 5000 × faster.","PeriodicalId":426801,"journal":{"name":"Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115989647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Wordgen : a Timed word Generation Tool Wordgen:一个定时单词生成工具

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587116

Benoît Barbot, Nicolas Basset, Alexandre Donzé

引用次数: 1

Stealthy attacks formalized as STL formulas for Falsification of CPS Security 隐蔽攻击形式化为伪造CPS安全的STL公式

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587122

Aniruddh Chandratre, Tomas Hernandez Acosta, Tanmay Khandait, Giulia Pedrielli, Georgios Fainekos

引用次数: 1

Poster Abstract: Safety Guaranteed Preference Learning Approach for Autonomous Vehicles 摘要:自动驾驶汽车的安全保证偏好学习方法

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3589549

Ruya Karagulle, N. Aréchiga, A. Best, Jonathan DeCastro, N. Ozay

引用次数: 1

Characterization of the ordering of path-complete stability certificates with addition-closed templates 用加闭模板描述路径完备稳定性证书的排序

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587114

Virginie Debauche, Matteo Della Rossa, R. Jungers

引用次数: 0

Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems 网络物理系统传感器攻击的定量鲁棒性分析

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587118

Stephen Chong, R. Lanotte, Massimo Merro, S. Tini, Jian Xiang

{"title":"Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems","authors":"Stephen Chong, R. Lanotte, Massimo Merro, S. Tini, Jian Xiang","doi":"10.1145/3575870.3587118","DOIUrl":"https://doi.org/10.1145/3575870.3587118","url":null,"abstract":"This paper contributes a formal framework for quantitative analysis of bounded sensor attacks on cyber-physical systems, using the formalism of differential dynamic logic. Given a precondition and postcondition of a system, we formalize two quantitative safety notions, quantitative forward and backward safety, which respectively express (1) how strong the strongest postcondition of the system is with respect to the specified postcondition, and (2) how strong the specified precondition is with respect to the weakest precondition of the system needed to ensure the specified postcondition holds. We introduce two notions, forward and backward robustness, to characterize the robustness of a system against sensor attacks as the loss of safety. Two simulation distances, which respectively characterize upper bounds of the degree of forward and backward safety loss caused by the sensor attacks, are developed to reason with robustness. We verify the two simulation distances by expressing them as formulas of differential dynamic logic. We showcase an example of an autonomous vehicle that needs to avoid a collision.","PeriodicalId":426801,"journal":{"name":"Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mixed Integer Linear Programming Approach for Control Synthesis with Weighted Signal Temporal Logic 加权信号时序逻辑控制综合的混合整数线性规划方法

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587120

G. Cardona, Disha Kamale, C. Vasile

{"title":"Mixed Integer Linear Programming Approach for Control Synthesis with Weighted Signal Temporal Logic","authors":"G. Cardona, Disha Kamale, C. Vasile","doi":"10.1145/3575870.3587120","DOIUrl":"https://doi.org/10.1145/3575870.3587120","url":null,"abstract":"This work presents an optimization-based control synthesis approach for an extension of Signal Temporal Logic (STL) called weighted Signal Temporal Logic (wSTL). wSTL was proposed to accommodate user preferences for importance and priorities over concurrent and sequential tasks as well as satisfaction times denoted by weights over the logical and temporal operators, respectively. We propose a Mixed Integer Linear Programming (MILP) based approach for synthesis with wSTL specifications. These specifications have the same qualitative semantics as STL but differ in their quantitative semantics, which is recursively modulated with weights. Additionally, we extend the formal definition of wSTL to include the semantics for until and release temporal operators and present an efficient encoding for these operators in the MILP formulation. As opposed to the original implementation of wSTL, where the arithmetic-geometric mean robustness was used with gradient-based methods prone to local optima, our encoding allows the use of a weighted version of traditional robustness and efficient global MILP solvers. We demonstrate the operational performance of the proposed formulation using multiple case studies, showcasing the distinct functionalities over Boolean and temporal operators. Moreover, we elaborate on multiple case studies for synthesizing controllers for an agent navigating a non-convex environment under different constraints highlighting the difference in synthesized control plans for STL and wSTL. Finally, we compare the time and complexity performance of encodings for STL and wSTL.","PeriodicalId":426801,"journal":{"name":"Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129012172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Poster Abstract: Reachability and Controlled Invariance for Human Stability during Sit-to-Stand 摘要:人体坐立稳定性的可达性和可控不变性

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3589548

Daphna Raz, Liren Yang, B. Umberger, N. Ozay

引用次数: 0

Safe Self-Triggered Control Based on Precomputed Reachability Sequences 基于预计算可达性序列的安全自触发控制

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587124

A. Adimoolam, I. Saha, T. Dang

{"title":"Safe Self-Triggered Control Based on Precomputed Reachability Sequences","authors":"A. Adimoolam, I. Saha, T. Dang","doi":"10.1145/3575870.3587124","DOIUrl":"https://doi.org/10.1145/3575870.3587124","url":null,"abstract":"Self-triggered controllers have the potential to improve the state-of-the-art of Cyber-Physical Systems (CPSs) by enhancing the performance of the underlying closed-loop control systems. However, a major concern in deploying a self-triggered controller in a safety-critical CPS is that the stabilizing self-triggered controller may not always guarantee the satisfaction of the safety constraints. We propose a self-triggered control scheme that deals with the safe scheduling of control tasks for uncertain continuous-time linear systems. We derive a computationally efficient scheduling function that computes an upper bound on the next sampling period as a function of the current state in the presence of additive disturbance. To reduce the computational complexity of online reachability analysis and increase accuracy, we compute a large sequence of reachable sets offline and use these precomputed sets to derive a low-complexity online scheduling function that computes sufficiently large bounds in real time. We evaluate our algorithm on three high-dimensional benchmark control systems, where two of the examples have a twelve-dimensional joint state plus feedback input. Experimental results demonstrate that our self-triggered control algorithm guarantees the safety of the closed-loop control system through negligible online computation, establishing the feasibility of its practical implementation.","PeriodicalId":426801,"journal":{"name":"Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121589007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions 参数定时正则表达式的模式匹配与参数识别

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control Pub Date : 2023-05-09 DOI: 10.1145/3575870.3587115

Akshay Mambakam, E. Asarin, Nicolas Basset, T. Dang

{"title":"Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions","authors":"Akshay Mambakam, E. Asarin, Nicolas Basset, T. Dang","doi":"10.1145/3575870.3587115","DOIUrl":"https://doi.org/10.1145/3575870.3587115","url":null,"abstract":"Timed formalisms such as Timed Automata (TA), Signal Temporal Logic (STL) and Timed Regular expressions (TRE) have been previously applied as behaviour specifications for monitoring or runtime verification, in particular, under the form of pattern-matching, i.e. computing the set of all the segments of a given system run that satisfy the specification. In this work, timed regular expressions with parameters (for timing delays and for signal values) are considered. We define several classes of parametric expressions (based on Boolean or real-valued signals and discrete events), and tackle the problem of computing a parametric match-set, i.e. the parameter values and time segments of data that give a match for a given expression. We propose efficient data structures for representing match-sets (combining zones and polytopes), and devise pattern-matching algorithms. All these different types and algorithms are combined into a single implementation under a tool named parameTRE. We illustrate the approach on several examples, from electrocardiograms to driving patterns.","PeriodicalId":426801,"journal":{"name":"Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133520675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0