Verification of probabilistic bounded $δ$-reachability for cyber-physical systems

Verification of cyber-physical systems is a difficult, yet extremely important, problem. Hybrid systems offer a theoretical framework in which to perform formal verification of cyberphysical systems. In this paper we study the problem of bounded δ-reachability in hybrid systems with random initial parameters. We devise a technique for computing reachability probabilities over a finite number of discrete steps for nonlinear hybrid systems featuring a bounded random initial parameter. Our approach is to define an appropriate δ-relaxation of the (undecidable) reachability problem, so that it can be solved by a δ-complete decision procedure. Specifically, we can compute an interval that is guaranteed to contain the probability of, say, a hybrid system behaving in a faulty way. Moreover, we discuss certain types of random variables with unbounded support and show that the bounded δ-reachability problem can still be solved by using an appropriate δ-complete decision procedure. Finally, we propose the development of a validated integration procedure over an arbitrary Borel set in order to cope with hybrid systems with dynamics given by solutions of ordinary differential equations.

[1]  Wei Chen,et al.  Delta-Complete Analysis for Bounded Reachability of Hybrid Systems , 2014, ArXiv.

[2]  A. Tiwari Formal Semantics and Analysis Methods for Simulink Stateflow Models , 2001 .

[3]  Daniel Kroening,et al.  A Tool for Checking ANSI-C Programs , 2004, TACAS.

[4]  Walter Krämer,et al.  FILIB++, a fast interval library supporting containment computations , 2006, TOMS.

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

[6]  Pieter J. Mosterman,et al.  Towards Computational Hybrid System Semantics for Time-Based Block Diagrams , 2009, ADHS.

[7]  Edmund M. Clarke,et al.  δ-Complete Decision Procedures for Satisfiability over the Reals , 2012, IJCAR.

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

[9]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

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

[11]  Christel Baier,et al.  Rare-event verification for stochastic hybrid systems , 2012, HSCC '12.

[12]  Håkan L. S. Younes,et al.  Statistical probabilistic model checking with a focus on time-bounded properties , 2006, Inf. Comput..

[13]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[14]  Edmund M. Clarke,et al.  dReal: An SMT Solver for Nonlinear Theories over the Reals , 2013, CADE.

[15]  Frédéric Benhamou,et al.  Continuous and Interval Constraints , 2006, Handbook of Constraint Programming.

[16]  Gabor Karsai,et al.  Semantic Translation of Simulink/Stateflow Models to Hybrid Automata Using Graph Transformations , 2004, GT-VMT@ETAPS.

[17]  Sérgio Galdino Interval Integration Revisited , 2012 .

[18]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[19]  Reuven Y. Rubinstein,et al.  Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.

[20]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.