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

筛选
英文 中文
Falsification of cyber-physical systems through multi-fidelity stochastic optimization 通过多保真度随机优化伪造信息物理系统
Alireza Inanlouganji, Shakiba Yaghoubi, Georgios Fainekos, Giulia Pedrielli
{"title":"Falsification of cyber-physical systems through multi-fidelity stochastic optimization","authors":"Alireza Inanlouganji, Shakiba Yaghoubi, Georgios Fainekos, Giulia Pedrielli","doi":"10.1145/3313149.3313371","DOIUrl":"https://doi.org/10.1145/3313149.3313371","url":null,"abstract":"This talk will review some recent results on requirements driven search-based testing for Cyber-Physical Systems (CPS). Namely, we will present an extension to a Bayesian optimizer that makes use of models of different complexity (and accuracy) that allow obtaining several approximations of the guiding cost function. The goal of the method is to enable falsification of computationally expensive simulation models through the use of simpler but much faster simulation models.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130144978","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
Limit reachability for model-free reinforcement learning of ω-regular objectives ω规则目标的无模型强化学习的极限可达性
E. M. Hahn, Mateo Perez, S. Schewe, F. Somenzi, Ashutosh Trivedi, D. Wojtczak
{"title":"Limit reachability for model-free reinforcement learning of ω-regular objectives","authors":"E. M. Hahn, Mateo Perez, S. Schewe, F. Somenzi, Ashutosh Trivedi, D. Wojtczak","doi":"10.1145/3313149.3313369","DOIUrl":"https://doi.org/10.1145/3313149.3313369","url":null,"abstract":"We have recently solved the model-free reinforcement learning of ω-regular objectives for Markov decision processes. We outline our constructive reduction from the almost-sure satisfaction of ω-regular objectives to an almost-sure reachability problem, and extend this technique to learning how to control an unknown model so that the chance of satisfying the objective is maximized. A key feature of our technique is the compilation of ω-regular properties into limit-deterministic Büchi automata, which sidesteps difficulties associated with the traditional Rabin automata. Our approach allows us to apply model-free, off-the-shelf reinforcement learning algorithms to compute optimal strategies from the observations of the Markov decision process.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117220495","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
Correct-by-construction policies for POMDPs pomdp的施工纠正政策
N. Jansen, Sebastian Junges, J. Katoen, Tim Quatmann, B. Becker, Ralf Wimmer, Leonore Winterer
{"title":"Correct-by-construction policies for POMDPs","authors":"N. Jansen, Sebastian Junges, J. Katoen, Tim Quatmann, B. Becker, Ralf Wimmer, Leonore Winterer","doi":"10.1145/3313149.3313366","DOIUrl":"https://doi.org/10.1145/3313149.3313366","url":null,"abstract":"Summary. In this extended abstract, we discuss how to compute policies with finite memory---so-called finite-state controllers (FSCs)---for partially observable Markov decision processes (POMDPs) that are provably correct with respect to given specifications. In particular, for a POMDP M and a specification φ, we want to solve the decision problem whether there is a policy σ for M with k memory states, such that φ is satisfied by M and σ (Mσ |= φ). The underlying method is achieved via a marriage of formal verification and artificial intelligence. The key insight is that computing (randomized) FSCs on POMDPs is equivalent to---and computationally as hard as---synthesis for parametric Markov chains (pMCs). The parameter synthesis problem is to decide whether for a parametric Markov chain (pMC) M and a specification φ there is a parameter instantiation u such that in the Markov chain (MC) induced by u the specification is satisfied (M[u] |= φ). The correspondence---depicted in Figure 1---allows to utilize efficient tools for synthesis in pMCs to compute correct-by-construction FSCs on POMDPs.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115341204","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
Sampling-free enforcement of non-gaussian chance constraints via fourier transforms 通过傅里叶变换实现非高斯机会约束的无采样
Abraham P. Vinod, Vignesh Sivaramakrishnan, Meeko Oishi
{"title":"Sampling-free enforcement of non-gaussian chance constraints via fourier transforms","authors":"Abraham P. Vinod, Vignesh Sivaramakrishnan, Meeko Oishi","doi":"10.1145/3313149.3313367","DOIUrl":"https://doi.org/10.1145/3313149.3313367","url":null,"abstract":"Verification of stochastic dynamical systems can often be formulated as chance-constrained optimization problems - maximize probability of satisfaction of safety/reachability objectives subject to dynamics and control bounds. For linear systems perturbed by Gaussian noise, chance-constraint techniques have proven to be highly efficient. With the goal of extending this approach to non-Gaussian disturbances, this short paper focuses on tractable approaches to enforce chance constraints involving non-Gaussian random vectors. After reviewing existing techniques, we propose a novel approach to enforce chance constraints for arbitrary disturbances using Fourier transforms that is sampling-free and provides tight approximations. We demonstrate the efficiency of our approach in a simple example.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126835524","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
Preview of predictive monitoring for signal temporal logic with probabilistic guarantees 具有概率保证的信号时序逻辑预测监测预览
Xin Qin, Jyotirmoy V. Deshmukh
{"title":"Preview of predictive monitoring for signal temporal logic with probabilistic guarantees","authors":"Xin Qin, Jyotirmoy V. Deshmukh","doi":"10.1145/3313149.3313370","DOIUrl":"https://doi.org/10.1145/3313149.3313370","url":null,"abstract":"Monitoring is an effective approach for identifying safety violations for complex cyber-physical systems. In this paper, we consider safety specifications expressed in Signal Temporal Logic (STL). STL is a logic for specifying timed properties of real-valued signals, and there has been significant work on offline and online monitoring of STL formulas on signals. Boolean monitoring techniques solve the problem of determining if a given STL formula is satisfied by a signal, while robust monitoring techniques seek to compute a quantitative degree of satisfaction of the formula. Online techniques can compute satisfaction or violation of the formula when the entire signal is not available, but existing online techniques can only provide worst-case estimates of satisfaction (or violation). In this paper, we propose algorithms to predict the satisfaction or violation of an STL formula when only partial information of a trace (i.e. its prefix) is available. The output of our algorithm is a predicted interval for the robust satisfaction value, along with a probabilistic guarantee on the correctness of the prediction. We demonstrate the utility of our approach on monitoring a safety-critical signal in the context of an unmanned aerial vehicle.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134082944","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}
引用次数: 1
Achievements in correct-by-design control for stochastic systems 随机系统设计正确控制的研究进展
S. Haesaert, S. Soudjani
{"title":"Achievements in correct-by-design control for stochastic systems","authors":"S. Haesaert, S. Soudjani","doi":"10.1145/3313149.3313368","DOIUrl":"https://doi.org/10.1145/3313149.3313368","url":null,"abstract":"Discrete-time stochastic systems are an essential modeling tool for many engineering systems. The direct synthesis of controllers for guaranteeing temporal properties encoded as finite automata has gain significant attention. Still, for many physical systems, computational issues make the synthesis problematic due to the inherent continuity and complexity of the state space. This extended abstract summarises achievements made in correct-by-design robust controller synthesis of stochastic systems using approximate simulation relations.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115226291","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}
引用次数: 1
Compositional finite abstractions for large-scale stochastic switched systems 大规模随机切换系统的组成有限抽象
Abolfazl Lavaei, Majid Zamani
{"title":"Compositional finite abstractions for large-scale stochastic switched systems","authors":"Abolfazl Lavaei, Majid Zamani","doi":"10.1145/3313149.3313347","DOIUrl":"https://doi.org/10.1145/3313149.3313347","url":null,"abstract":"In this paper, we provide for the first time a compositional methodology for the construction of finite MDPs for networks of stochastic switched systems. The proposed technique leverages sufficient small-gain type conditions to establish the compositionality results which rely on relations between subsystems and their abstractions described by the existence of stochastic simulation functions. This type of relations enable us to compute the probabilistic error between the interconnection of concrete subsystems and that of their finite abstractions. In this respect, we show that if a switched system is incremental input-to-state stable (i.e., existence of a common incremental Lyapunov function, or multiple incremental Lyapunov functions with dwell-time), one can construct stochastic simulation functions between finite abstractions and concrete models. We also propose a construction framework for a particular class of nonlinear stochastic switched systems by satisfying some easier to check matrix inequalities. To demonstrate the effectiveness of our proposed results, we apply our approaches to two different case studies.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121700970","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
Symbolic-numeric methods in reasoning about the design of future air traffic management 未来空中交通管理设计的符号-数值推理方法
H. Blom
{"title":"Symbolic-numeric methods in reasoning about the design of future air traffic management","authors":"H. Blom","doi":"10.1145/3313149.3313373","DOIUrl":"https://doi.org/10.1145/3313149.3313373","url":null,"abstract":"In our busy skies and airports, commercial aviation critically depends on air traffic management (ATM). ATM forms a complex Cyber Physical Human System (CPHS) that involves dynamic interactions under uncertainties (e.g. weather) between distributed human decision makers (e.g. pilots and air traffic controllers), dynamical systems (e.g. aircraft control and decision-support systems) and infrastructure (e.g. airports). Over decades, this complex CPHS has evolved to its current form through systematic learning from incident and accident investigations. This has made current ATM resilient and safe under a broad spectrum of disturbances. Novel technology and growing demands in commercial air transport form strong drivers for the design and implementation of significant changes in ATM's complex CPHS. Due to dynamic interactions between distributed CPHS entities, such changes may trigger unforeseen emergent behaviour. The challenge is to identify such behaviour already during the early design phase of future ATM. This asks for symbolic-numerical methods for reasoning about the performance, including incidents and accidents, of a future ATM's CPHS design, and to feedback such performance learning to the CPHS design. This presentation explains how the identification and understanding of unknown emergent behaviour of a CPHS design for future ATM can be accomplished through making integrated use of various formal methods, such as compositional model development of large stochastic hybrid systems [1], managing bi-similarity transformations [2-3], as well as conducting probabilistic reachability analysis through rare event simulation [4-5]. The practical use of these methods is illustrated to CPHS designs of future ATM, where the role of air traffic control is replaced by advanced decision-support to pilots. Results obtained for this future ATM design reveal remarkable emergent behavior [6] that was not foreseen by the CPHS design team. This challenging ATM application also illustrates needs for further development of symbolic-numeric methods for the evaluation of complex CPHS designs.","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126707349","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
Neural state classification for hybrid systems 混合系统的神经状态分类
Dung Phan, Nicola Paoletti, Timothy Zhang, R. Grosu, S. Smolka, S. Stoller
{"title":"Neural state classification for hybrid systems","authors":"Dung Phan, Nicola Paoletti, Timothy Zhang, R. Grosu, S. Smolka, S. Stoller","doi":"10.1145/3313149.3313372","DOIUrl":"https://doi.org/10.1145/3313149.3313372","url":null,"abstract":"Model checking of hybrid systems is usually expressed in terms of the following reachability problem for hybrid automata (HA) [6]: given an HA M, a set of initial states I, and a set of unsafe states U, determine whether there exists a trajectory of M starting in an initial state and ending in an unsafe state. The time-bounded version of this problem considers trajectories that are within a given time bound T. We introduce the State Classification Problem (SCP), a generalization of the model checking problem for hybrid systems. Let B = {0,1} be the set of Boolean values. Given an HA M with state space S(M), time bound T, and set of unsafe states U ⊂ S(M), the SCP problem is to find a function F*: S(M) → B such that for all s ∈ S(M), F* (s) = 1 if M |= Reach (U ,s,T), i.e., if it is possible for M, starting in s, to reach a state in U within time T ; F*(s) = 0 otherwise. A state s ⊂ S(M) is called positive if F*(s) = 1. Otherwise, s is negative. We call such a function a state classifier. State classification is also useful in at least two other contexts. First, due to random disturbances, a hybrid system may restart in a random state outside the initial region, and we may wish to check the system's safety from that state. Secondly, a classifier can be used for online model checking [10], where in the process of monitoring a system's behavior, one would like to determine, in real-time, the fate of the system going forward from the current (non-initial) state. This paper shows how deep neural networks (DNNs) can be used for state classification, an approach we refer to as Neural State Classification (NSC). An NSC classifier is subject to false positives (FPs) and, more importantly, false negatives (FNs). An FP occurs when a state s is deemed positive when it is actually negative, and, likewise, an FN occurs when s is deemed negative when it is actually positive. A well-trained NSC classifier offers high accuracy, runs in constant time (approx. 1 ms in our experiments), and takes constant space (e.g., a DNN with l hidden layers and n neurons only requires functions of dimension l · n for its encoding). This makes NSC classifiers very appealing for applications such as online model checking, a type of analysis subject to strict time and space constraints. Our approach can also classify states of parametric HA by encoding each parameter as an additional input to the classifier. This makes NSC more versatile than state-of-the-art hybrid system reachability tools, which provide little or no support for parametric analysis [3,4]. The NSC method is summarized in Figure 1. We train the state classifier using supervised learning, where the training examples are derived by sampling the state and parameter spaces according to some distribution. Reachability values for the examples are computed by invoking an oracle, i.e., an hybrid system model checker [4] or a simulator when the system is deterministic. We evaluate a trained state classifier by estimating it","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124555792","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}
引用次数: 17
Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT 第五届关于CPS和IoT推理的符号-数值方法国际研讨会论文集
{"title":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","authors":"","doi":"10.1145/3313149","DOIUrl":"https://doi.org/10.1145/3313149","url":null,"abstract":"","PeriodicalId":314845,"journal":{"name":"Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129508616","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书