SMT-Based Symbolic Encoding and Formal Analysis of HML Models

Hybrid system is a dynamic system that involves continuous, discrete behaviors, and the interactions between continuous physical components and discrete controllers. In this paper a hybrid modeling language (called HML) for hybrid systems is extended with templates to achieve code reuse. For the formal analysis of the corresponding hybrid system models in this modeling language, these models are translated into SMT (satisfiability modulo theories) formulas as the input to an SMT solver dReal which retains the capability of bounded reachability analysis for non-linear hybrid systems. Moreover, dReal can produce data for potential traces of hybrid systems, thus it can be employed to simulate on hybrid systems. In this paper the simulation and reachability analysis are integrated in a prototype tool (open source). We present a case study for an inverted pendulum with PID (Proportional-Integral-Derivative) controllers and a rod reactor system for temperature control, both are verified to demonstrate the efficiency of the prototype tool. We conclude that, this modeling language is capable of modeling and verification of hybrid systems based on simulation and bounded reachability analysis.

[1]  A. Girard,et al.  Reachability analysis of linear systems using support functions , 2010 .

[2]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[3]  Michel A. Reniers,et al.  Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..

[4]  Edmund M. Clarke,et al.  Satisfiability modulo ODEs , 2013, 2013 Formal Methods in Computer-Aided Design.

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

[6]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[7]  Goran Frehse.  PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech , 2005, HSCC.

[8]  C. A. R. Hoare,et al.  Notes on Communicating Sequential Systems , 1986 .

[9]  He Jifeng,et al.  From CSP to hybrid systems , 1994 .

[10]  Jifeng He.  Hybrid Relation Calculus , 2013, 2013 18th International Conference on Engineering of Complex Computer Systems.

[11]  Roberto Bruttomesso,et al.  The OpenSMT Solver , 2010, TACAS.

[12]  André Platzer,et al.  Logical Analysis of Hybrid Systems - Proving Theorems for Complex Dynamics , 2010 .

[13]  Xin Chen,et al.  Flow*: An Analyzer for Non-linear Hybrid Systems , 2013, CAV.

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

[15]  Zohar Manna,et al.  From Timed to Hybrid Systems , 1991, REX Workshop.

[16]  W. Chang,et al.  PID controller design of nonlinear systems using an improved particle swarm optimization approach , 2010 .

[17]  Anders P. Ravn,et al.  A Formal Description of Hybrid Systems , 1996, Hybrid Systems.

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

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

[20]  Timothy J. Gale,et al.  Direct adaptive fuzzy control with a self-structuring algorithm , 2008, Fuzzy Sets Syst..

[21]  J. Yi,et al.  Stabilization fuzzy control of inverted pendulum systems , 2000, Artif. Intell. Eng..

[22]  Martin Berz,et al.  Verified Integration of ODEs and Flows Using Differential Algebraic Methods on High-Order Taylor Models , 1998, Reliab. Comput..

[23]  Clark W. Barrett,et al.  The SMT-LIB Standard Version 2.0 , 2010 .

[24]  Wei Chen,et al.  dReach: δ-Reachability Analysis for Hybrid Systems , 2015, TACAS.

[25]  Xianping Guo,et al.  Continuous-Time Markov Decision Processes: Theory and Applications , 2009 .

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

[27]  Nancy A. Lynch,et al.  Hybrid I/O automata , 1995, Inf. Comput..

[28]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

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

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

[31]  Nancy A. Lynch,et al.  Hybrid I/O Automata Revisited , 2001, HSCC.

[32]  P. W. Hawkes,et al.  Modern map methods in particle beam physics , 1999 .

[33]  Martin von Mohrenschildt,et al.  Symbolic Verification of Hybrid Systems: An Algebraic Approach , 2001, Eur. J. Control.

[34]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[35]  Peter Fritzson,et al.  Modelica - A Unified Object-Oriented Language for System Modelling and Simulation , 1998, ECOOP.

[36]  Xin Chen,et al.  A Benchmark Suite for Hybrid Systems Reachability Analysis , 2015, NFM.

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

[38]  Frédéric Benhamou,et al.  Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques , 2006, TOMS.

[39]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[40]  G. Frehse,et al.  Assume-guarantee reasoning for hybrid I/O-automata by over-approximation of continuous interaction , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).