International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT最新文献

Model Checking for Rectangular Hybrid Systems: A Quantified Encoding Approach 矩形混合系统的模型检验:一种量化编码方法

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2022-07-10 DOI: 10.4204/EPTCS.361.4

L. V. Nguyen, Wesam Haddad, Taylor T. Johnson

{"title":"Model Checking for Rectangular Hybrid Systems: A Quantified Encoding Approach","authors":"L. V. Nguyen, Wesam Haddad, Taylor T. Johnson","doi":"10.4204/EPTCS.361.4","DOIUrl":"https://doi.org/10.4204/EPTCS.361.4","url":null,"abstract":"Satisfiability Modulo Theories (SMT) solvers have been successfully applied to solve many problems in formal verification such as bounded model checking (BMC) for many classes of systems from integrated circuits to cyber-physical systems. Typically, BMC is performed by checking satisfiability of a possibly long, but quantifier-free formula. However, BMC problems can naturally be encoded as quantified formulas over the number of BMC steps. In this approach, we then use decision procedures supporting quantifiers to check satisfiability of these quantified formulas. This approach has previously been applied to perform BMC using a Quantified Boolean Formula (QBF) encoding for purely discrete systems, and then discharges the QBF checks using QBF solvers. In this paper, we present a new quantified encoding of BMC for rectangular hybrid automata (RHA), which requires using more general logics due to the real (dense) time and real-valued state variables modeling continuous states. We have implemented a preliminary experimental prototype of the method using the HyST model transformation tool to generate the quantified BMC (QBMC) queries for the Z3 SMT solver. We describe experimental results on several timed and hybrid automata benchmarks, such as the Fischer and Lynch-Shavit mutual exclusion algorithms. We compare our approach to quantifier-free BMC approaches, such as those in the dReach tool that uses the dReal SMT solver, and the HyComp tool built on top of nuXmv that uses the MathSAT SMT solver. Based on our promising experimental results, QBMC may in the future be an effective and scalable analysis approach for RHA and other classes of hybrid automata as further improvements are made in quantifier handling in SMT solvers such as Z3.","PeriodicalId":313825,"journal":{"name":"International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122577109","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

Robot Swarms as Hybrid Systems: Modelling and Verification 作为混合系统的机器人群:建模与验证

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2022-07-10 DOI: 10.4204/EPTCS.361.7

Stefan Schupp, Francesco Leofante, E. Ábrahám, A. Tacchella

引用次数: 1

Work In Progress: Safety and Robustness Verification of Autoencoder-Based Regression Models using the NNV Tool 正在进行的工作:使用NNV工具的基于自编码器的回归模型的安全性和鲁棒性验证

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2022-07-10 DOI: 10.4204/EPTCS.361.8

Neelanjana Pal, Taylor T. Johnson

{"title":"Work In Progress: Safety and Robustness Verification of Autoencoder-Based Regression Models using the NNV Tool","authors":"Neelanjana Pal, Taylor T. Johnson","doi":"10.4204/EPTCS.361.8","DOIUrl":"https://doi.org/10.4204/EPTCS.361.8","url":null,"abstract":"This work in progress paper introduces robustness verification for autoencoder-based regression neural network (NN) models, following state-of-the-art approaches for robustness verification of image classification NNs. Despite the ongoing progress in developing verification methods for safety and robustness in various deep neural networks (DNNs), robustness checking of autoencoder models has not yet been considered. We explore this open space of research and check ways to bridge the gap between existing DNN verification methods by extending existing robustness analysis methods for such autoencoder networks. While classification models using autoencoders work more or less similar to image classification NNs, the functionality of regression models is distinctly different. We introduce two definitions of robustness evaluation metrics for autoencoder-based regression models, specifically the percentage robustness and un-robustness grade. We also modified the existing Imagestar approach, adjusting the variables to take care of the specific input types for regression networks. The approach is implemented as an extension of NNV, then applied and evaluated on a dataset, with a case study experiment shown using the same dataset. As per the authors' understanding, this work in progress paper is the first to show possible reachability analysis of autoencoder-based NNs.","PeriodicalId":313825,"journal":{"name":"International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122885287","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

Verification of Sigmoidal Artificial Neural Networks using iSAT 利用iSAT验证s型人工神经网络

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2022-07-10 DOI: 10.4204/EPTCS.361.6

Dominik Grundt, Sorin Liviu Jurj, Willem Hagemann, P. Kröger, M. Fränzle

引用次数: 1

Verification and Reachability Analysis of Fractional-Order Differential Equations Using Interval Analysis 分数阶微分方程的区间验证与可达性分析

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2021-01-14 DOI: 10.4204/EPTCS.331.2

A. Rauh, Julia Kersten

{"title":"Verification and Reachability Analysis of Fractional-Order Differential Equations Using Interval Analysis","authors":"A. Rauh, Julia Kersten","doi":"10.4204/EPTCS.331.2","DOIUrl":"https://doi.org/10.4204/EPTCS.331.2","url":null,"abstract":"Interval approaches for the reachability analysis of initial value problems for sets of classical ordinary differential equations have been investigated and implemented by many researchers during the last decades. However, there exist numerous applications in computational science and engineering, where continuous-time system dynamics cannot be described adequately by integer-order differential equations. Especially in cases in which long-term memory effects are observed, fractional-order system representations are promising to describe the dynamics, on the one hand, with sufficient accuracy and, on the other hand, to limit the number of required state variables and parameters to a reasonable amount. Real-life applications for such fractional-order models can, among others, be found in the field of electrochemistry, where methods for impedance spectroscopy are typically used to identify fractional-order models for the charging/discharging behavior of batteries or for the dynamic relation between voltage and current in fuel cell systems if operated in a non-stationary state. This paper aims at presenting an iterative method for reachability analysis of fractional-order systems that is based on an interval arithmetic extension of Mittag-Leffler functions. An illustrating example, inspired by a low-order model of battery systems concludes this contribution.","PeriodicalId":313825,"journal":{"name":"International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122896735","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}

引用次数: 4

Analysis of E-commerce Ranking Signals via Signal Temporal Logic 基于信号时序逻辑的电子商务排名信号分析

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2021-01-11 DOI: 10.4204/EPTCS.331.3

Tommaso Dreossi, Giorgio Ballardin, Parth Gupta, J. Bakus, Yu-Hsiang Lin, Vamsi Salaka

引用次数: 0

Interval centred form for proving stability of non-linear discrete-time systems 证明非线性离散系统稳定性的区间中心形式

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2021-01-11 DOI: 10.4204/EPTCS.331.1

Auguste Bourgois, L. Jaulin

引用次数: 3

Enclosing the Sliding Surfaces of a Controlled Swing 封闭受控秋千的滑动面

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 2021-01-11 DOI: 10.4204/EPTCS.331.4

L. Jaulin, B. Desrochers

引用次数: 0

Proceedings The 7th International Workshop on Symbolic-Numeric Methods for Reasoning about CPS and IoT, SNR 2021, Online, 23rd August 2021 第七届关于CPS和IoT推理的符号-数值方法国际研讨会论文集，SNR 2021，在线，2021年8月23日

International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT Pub Date : 1900-01-01 DOI: 10.48550/arXiv.2207.04391

引用次数: 0