HyComp: An SMT-Based Model Checker for Hybrid Systems

HyComp is a model checker for hybrid systems based on Satisfiability Modulo Theories SMT. HyComp takes as input networks of hybrid automata specified using the HyDI symbolic language. HyComp relies on the encoding of the network into an infinite-state transition system, which can be analyzed using SMT-based verification techniques e.g. BMC, K-induction, IC3. The tool features specialized encodings of the automata network and can discretize various kinds of dynamics. HyComp can verify invariant and LTL properties, and scenario specifications; it can also perform synthesis of parameters ensuring the satisfaction of a given invariant property. All these features are provided either through specialized algorithms, as in the case of scenario or LTL verification, or applying off-the-shelf algorithms based on SMT. We describe the tool in terms of functionalities, architecture, and implementation, and we present the results of an experimental evaluation.

[1]  Rajeev Alur,et al.  Counterexample-guided predicate abstraction of hybrid systems , 2006, Theor. Comput. Sci..

[2]  André Platzer,et al.  KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description) , 2008, IJCAR.

[3]  Goran Frehse,et al.  PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.

[4]  Alberto Griggio,et al.  Verifying LTL Properties of Hybrid Systems with K-Liveness , 2014, CAV.

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

[6]  Farn Wang,et al.  Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures , 2004, IEEE Transactions on Software Engineering.

[7]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[8]  Alberto Griggio,et al.  IC3 Modulo Theories via Implicit Predicate Abstraction , 2013, TACAS.

[9]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

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

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

[12]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[13]  Silvio Ghilardi,et al.  MCMT: A Model Checker Modulo Theories , 2010, IJCAR.

[14]  Alessandro Cimatti,et al.  Quantifier-free encoding of invariants for hybrid systems , 2014, Formal Methods Syst. Des..

[15]  Alessandro Cimatti,et al.  Model Checking of Hybrid Systems Using Shallow Synchronization , 2010, FMOODS/FORTE.

[16]  Thomas A. Henzinger,et al.  HYTECH: The Cornell HYbrid TECHnology Tool , 1994, Hybrid Systems.

[17]  David Lee,et al.  Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings , 2009, FMOODS/FORTE.

[18]  Ilkka Niemelä,et al.  Bounded Model Checking of an MITL Fragment for Timed Automata , 2013, 2013 13th International Conference on Application of Concurrency to System Design.

[19]  Martin Fränzle.  What Will Be Eventually True of Polynomial Hybrid Automata? , 2001, TACS.

[20]  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.

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

[22]  Wang Yi,et al.  Partial Order Reductions for Timed Systems , 1998, CONCUR.

[23]  Alessandro Cimatti,et al.  OCRA: A tool for checking the refinement of temporal contracts , 2013, 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE).

[24]  Ilkka Niemelä,et al.  SMT-Based Induction Methods for Timed Systems , 2012, FORMATS.

[25]  Thomas A. Henzinger,et al.  Hybrid Systems III , 1995, Lecture Notes in Computer Science.

[26]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[27]  Ana Cavalcanti,et al.  FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings , 2009, FM.

[28]  Stefan Ratschan,et al.  Safety verification of hybrid systems by constraint propagation-based abstraction refinement , 2007, TECS.

[29]  Alberto Griggio,et al.  Parameter synthesis with IC3 , 2013, 2013 Formal Methods in Computer-Aided Design.

[30]  Sergio Mover,et al.  Verification of Hybrid Systems using Satisfiability Modulo Theories , 2014 .

[31]  Stefano Tonetta,et al.  Abstract Model Checking without Computing the Abstraction , 2009, FM.

[32]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[33]  Taylor T. Johnson,et al.  A Small Model Theorem for Rectangular Hybrid Automata Networks , 2012, FMOODS/FORTE.

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

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

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

[37]  Davide Bresolin,et al.  Assume–guarantee verification of nonlinear hybrid systems with Ariadne , 2014 .

[38]  Ashish Tiwari,et al.  Sal 2 , 2004, CAV.

[39]  Marco Roveri,et al.  The nuXmv Symbolic Model Checker , 2014, CAV.

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

[41]  Ashish Tiwari,et al.  Time-aware relational abstractions for hybrid systems , 2013, 2013 Proceedings of the International Conference on Embedded Software (EMSOFT).

[42]  Ansgar Fehnker,et al.  Benchmarks for Hybrid Systems Verification , 2004, HSCC.

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

[44]  Panos J. Antsaklis,et al.  Hybrid Systems II , 1994, Lecture Notes in Computer Science.

[45]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[46]  Marco Bozzano,et al.  The FSAP/NuSMV-SA Safety Analysis Platform , 2007, International Journal on Software Tools for Technology Transfer.

[47]  Eugene Asarin,et al.  The d/dt Tool for Verification of Hybrid Systems , 2002, CAV.

[48]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

[49]  Ilkka Niemelä,et al.  Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata , 2012, FMOODS/FORTE.

[50]  Alberto Griggio,et al.  The MathSAT5 SMT Solver , 2013, TACAS.