scholarly journals Symbolic-Numeric Reachability Analysis of Hybrid Systems

10.29007/249v ◽  
2018 ◽  
Author(s):  
Sriram Sankaranarayanan

We consider the problem of reachability analysis in hybrid systems defined by the closed-loop interaction of a complex, continuous time plant model with a software-based controller. In practice, the plant model is, often, a coarse approximation of the real-world operating environment of the software, whereas the software itself is the artifact that ends up being deployed in the final system. In this talk, we summarize the state-of-the-art techniques for purely symbolic and purely numeric approaches to reachability analysis of hybrid systems. We make the case for approaches that combine simulation-based exploration of the plant state-space with a corresponding symbolic exploration of the controller. We propose a simple yet elegant method to carry out this joint symbolic-numeric exploration based on an abstraction of the plant model, and present promising experimental results on software-in-the-loop setups that are beyond the scope of many existing verification tools.

Author(s):  
Radoslav Ivanov ◽  
Taylor Carpenter ◽  
James Weimer ◽  
Rajeev Alur ◽  
George Pappas ◽  
...  

AbstractThis paper presents Verisig 2.0, a verification tool for closed-loop systems with neural network (NN) controllers. We focus on NNs with tanh/sigmoid activations and develop a Taylor-model-based reachability algorithm through Taylor model preconditioning and shrink wrapping. Furthermore, we provide a parallelized implementation that allows Verisig 2.0 to efficiently handle larger NNs than existing tools can. We provide an extensive evaluation over 10 benchmarks and compare Verisig 2.0 against three state-of-the-art verification tools. We show that Verisig 2.0 is both more accurate and faster, achieving speed-ups of up to 21x and 268x against different tools, respectively.


2009 ◽  
Vol 19 (12) ◽  
pp. 3111-3121 ◽  
Author(s):  
Hai-Bin ZHANG ◽  
Zhen-Hua DUAN

2013 ◽  
Vol 33 (5) ◽  
pp. 1289-1293
Author(s):  
Jin ZOU ◽  
Wang LIN ◽  
Yong LUO ◽  
Zhenbing ZENG

Author(s):  
Xin Chen ◽  
Stefan Schupp ◽  
Ibtissem Ben Makhlouf ◽  
Erika Ábrahám ◽  
Goran Frehse ◽  
...  

10.29007/f3rp ◽  
2018 ◽  
Author(s):  
Francesco Alberti ◽  
Roberto Bruttomesso ◽  
Silvio Ghilardi ◽  
Silvio Ranise ◽  
Natasha Sharygina

Reachability analysis of infinite-state systems plays a central role in many verification tasks. In the last decade, SMT-Solvers have been exploited within many verification tools to discharge proof obligations arising from reachability analysis. Despite this, as of today there is no standard language to deal with transition systems specified in the SMT-LIB format. This paper is a first proposal for a new SMT-based verification language that is suitable for defining transition systems and safety properties.


1997 ◽  
Vol 119 (2) ◽  
pp. 271-277 ◽  
Author(s):  
Jenq-Tzong H. Chan

In this paper, we present a modified method of data-based LQ controller design which is distinct in two major aspects: (1) one may prescribe the z-domain region within which the closed-loop poles of the LQ design are to lie, and (2) controller design is completed using only plant input and output data, and does not require explicit knowledge of a parameterized plant model.


Sign in / Sign up

Export Citation Format

Share Document