Probably Approximate Safety Verification of Hybrid Dynamical Systems

In this paper we present a method based on linear programming that facilitates reliable safety verification of hybrid dynamical systems subject to perturbation inputs over the infinite time horizon. The verification algorithm applies the probably approximately correct (PAC) learning framework and consequently can be regarded as statistically formal verification in the sense that it provides formal safety guarantees expressed using error probabilities and confidences. The safety of hybrid systems in this framework is verified via the computation of so-called PAC barrier certificates, which can be computed by solving a linear programming problem. Based on scenario approaches, the linear program is constructed by a family of independent and identically distributed state samples. In this way we can conduct verification of hybrid dynamical systems that existing methods are not capable of dealing with. Some preliminary experiments demonstrate the performance of our approach.

[1]  Xin Chen,et al.  Current Challenges in the Verification of Hybrid Systems , 2015, CyPhy.

[2]  Bai Xue,et al.  Underapproximating Backward Reachable Sets by Semialgebraic Sets , 2017, IEEE Transactions on Automatic Control.

[3]  Michel Kieffer,et al.  Construction of parametric barrier functions for dynamical systems using interval analysis , 2015, Autom..

[4]  Marco C. Campi,et al.  A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality , 2011, J. Optim. Theory Appl..

[5]  Stefan Ratschan,et al.  Simulation Based Computation of Certificates for Safety of Dynamical Systems , 2017, FORMATS.

[6]  Zhenbing Zeng,et al.  Exact safety verification of hybrid systems using sums-of-squares representation , 2011, Science China Information Sciences.

[7]  André Platzer,et al.  Vector Barrier Certificates and Comparison Systems , 2018, FM.

[8]  Stefan Ratschan.  Safety verification of non-linear hybrid systems is quasi-decidable , 2014, Formal Methods Syst. Des..

[9]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[10]  A. S. Vincentelli,et al.  Handbook of Hybrid Systems Control: Theory, Tools, Applications , 2011 .

[11]  Rajeev Alur,et al.  Formal verification of hybrid systems , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[12]  Jooyoung Park,et al.  Universal Approximation Using Radial-Basis-Function Networks , 1991, Neural Computation.

[13]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.

[14]  Rafael Wisniewski,et al.  Compositional safety analysis using barrier certificates , 2012, HSCC '12.

[15]  Bai Xue,et al.  Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties , 2018, IEEE Transactions on Automatic Control.

[16]  Giuseppe Carlo Calafiore,et al.  Random Convex Programs , 2010, SIAM J. Optim..

[17]  Xin Chen,et al.  Probabilistic Safety Verification of Stochastic Hybrid Systems Using Barrier Certificates , 2017, ACM Trans. Embed. Comput. Syst..

[18]  Ali Jadbabaie,et al.  Safety Verification of Hybrid Systems Using Barrier Certificates , 2004, HSCC.

[19]  Paolo Zuliani,et al.  ProbReach: verified probabilistic delta-reachability for stochastic hybrid systems , 2014, HSCC.

[20]  Marco C. Campi,et al.  The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs , 2008, SIAM J. Optim..

[21]  Stefan Ratschan,et al.  Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement , 2005, HSCC.

[22]  Giuseppe Carlo Calafiore,et al.  The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.

[23]  Stefan Ratschan,et al.  Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions , 2010, SIAM J. Control. Optim..

[24]  David Haussler,et al.  Probably Approximately Correct Learning , 2010, Encyclopedia of Machine Learning.

[25]  Didier Henrion,et al.  Approximate Volume and Integration for Basic Semialgebraic Sets , 2009, SIAM Rev..

[26]  Xin Chen,et al.  Lyapunov Function Synthesis Using Handelman Representations , 2013, NOLCOS.

[27]  Bai Xue,et al.  Under-Approximating Backward Reachable Sets by Polytopes , 2016, CAV.

[28]  Liyun Dai,et al.  Barrier certificates revisited , 2013, J. Symb. Comput..

[29]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[30]  Bai Xue,et al.  Robust invariant sets generation for state-constrained perturbed polynomial systems , 2019, HSCC.

[31]  Zhengfeng Yang,et al.  Safety Verification of Nonlinear Hybrid Systems Based on Bilinear Programming , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[32]  Thomas A. Henzinger,et al.  Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters , 2017, HSCC.

[33]  Alexander Egyed,et al.  Invited Talk: A Roadmap for Engineering Safe and Secure Cyber-Physical Systems , 2018, MEDI Workshops.

[34]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[35]  Adel Djaballah.  Computation of barrier certificates for dynamical hybrids systems using interval analysis. (Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides) , 2017 .

[36]  Joost-Pieter Katoen,et al.  Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems , 2015, FORMATS.

[37]  Hui Kong,et al.  Exponential-Condition-Based Barrier Certificate Generation for Safety Verification of Hybrid Systems , 2013, CAV.

[38]  Edmund M. Clarke,et al.  Delta-Decidability over the Reals , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[39]  M. Campi,et al.  The scenario approach for systems and control design , 2008 .

[40]  Tarik Nahhal,et al.  Test Coverage for Continuous and Hybrid Systems , 2007, CAV.

[41]  Eugene Asarin,et al.  Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy , 1998, J. Comput. Syst. Sci..

[42]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[43]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[44]  J. Rohn,et al.  Linear interval inequalities , 1994 .

[45]  James Worrell,et al.  Costs and Rewards in Priced Timed Automata , 2018, ICALP.

[46]  Edmund M. Clarke,et al.  Bayesian statistical model checking with application to Stateflow/Simulink verification , 2010, Formal Methods in System Design.

[47]  Mohab Safey El Din,et al.  Computing the Volume of Compact Semi-Algebraic Sets , 2019, ISSAC.