Time-aware relational abstractions for hybrid systems

Hybrid Systems model both discrete switches and continuous dynamics and are suitable to represent embedded systems where discrete controllers interact with a physical plant. Relational abstraction is a new approach for verifying hybrid systems. In relational abstraction, the continuous dynamics in each location of the hybrid system is abstracted by a binary relation that relates the current value of the continuous variables with all future values of the variables that are reachable after a time elapse (continuous) transition. The abstract system is an infinite-state system, which can be verified using k-induction or abstract interpretation. Existing techniques for computing relational abstractions are time-agnostic: they do not construct any relationship between the state variables and the time elapsed during the continuous evolution. Time-agnostic abstractions cannot verify timing properties. We present a technique to compute a time-aware relational abstraction for verifying (timing-related) safety properties of cyber-physical systems. We show the effectiveness of the new abstraction on several case studies on which the previous techniques fail.

[1]  Alberto Griggio,et al.  Software Model Checking via IC3 , 2012, CAV.

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

[3]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[4]  Dejan Jovanović,et al.  Solving Non-linear Arithmetic , 2012, IJCAR.

[5]  Rajeev Alur,et al.  Predicate abstraction for reachability analysis of hybrid systems , 2006, TECS.

[6]  Ashish Tiwari,et al.  Nonlinear Systems: Approximating Reach Sets , 2004, HSCC.

[7]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[8]  Gerardo Lafferriere,et al.  Symbolic Reachability Computation for Families of Linear Vector Fields , 2001, J. Symb. Comput..

[9]  Bernd Becker,et al.  Optimizing Bounded Model Checking for Linear Hybrid Systems , 2005, VMCAI.

[10]  André Platzer,et al.  Differential Dynamic Logic for Hybrid Systems , 2008, Journal of Automated Reasoning.

[11]  Christopher W. Brown.  QEPCAD B: a program for computing with semi-algebraic sets using CADs , 2003, SIGS.

[12]  Alessandro Cimatti,et al.  SMT-based scenario verification for hybrid systems , 2013, Formal Methods Syst. Des..

[13]  Cesare Tinelli,et al.  Satisfiability Modulo Theories , 2021, Handbook of Satisfiability.

[14]  Alessandro Cimatti,et al.  HyDI: A Language for Symbolic Hybrid Systems with Discrete Interaction , 2011, 2011 37th EUROMICRO Conference on Software Engineering and Advanced Applications.

[15]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[16]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[17]  Zohar Manna,et al.  The calculus of computation - decision procedures with applications to verification , 2007 .

[18]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[19]  Nikolaj Bjørner,et al.  Generalized Property Directed Reachability , 2012, SAT.

[20]  Ashish Tiwari,et al.  Verification and synthesis using real quantifier elimination , 2011, ISSAC '11.

[21]  Alessandro Cimatti,et al.  A quantifier-free SMT encoding of non-linear hybrid automata , 2012, 2012 Formal Methods in Computer-Aided Design (FMCAD).

[22]  Harald Ruess,et al.  Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) , 2003, CAV.

[23]  Ashish Tiwari,et al.  HybridSAL Relational Abstracter , 2012, CAV.

[24]  Joël Ouaknine,et al.  Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems , 2003, Int. J. Found. Comput. Sci..

[25]  Antonio Bicchi,et al.  Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems , 2007, IEEE Transactions on Robotics.

[26]  Gary J. Balas,et al.  Road adaptive active suspension design using linear parameter-varying gain-scheduling , 2002, IEEE Trans. Control. Syst. Technol..

[27]  Ashish Tiwari,et al.  Relational Abstractions for Continuous and Hybrid Systems , 2011, CAV.

[28]  Antoine Girard,et al.  SpaceEx: Scalable Verification of Hybrid Systems , 2011, CAV.

[29]  Maria Sorea.  Bounded Model Checking for Timed Automata , 2002, Electron. Notes Theor. Comput. Sci..

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

[31]  Marco Bozzano,et al.  Verifying Industrial Hybrid Systems with MathSAT , 2005, BMC@CAV.

[32]  Ashish Tiwari,et al.  Timed Relational Abstractions for Sampled Data Control Systems , 2012, CAV.

[33]  Ashish Tiwari,et al.  Abstractions for hybrid systems , 2008, Formal Methods Syst. Des..