Relaxed Decidability and the Robust Semantics of Metric Temporal Logic

Relaxed notions of decidability widen the scope of automatic verification of hybrid systems. In quasi-decidability and delta-decidability, the fundamental compromise is that if we are willing to accept a slight error in the algorithm's answer, or a slight restriction on the class of problems we verify, then it is possible to obtain practically useful answers. This paper explores the connections between relaxed decidability and the robust semantics of Metric Temporal Logic formulas. It establishes a formal equivalence between the robustness degree of MTL specifications, and the imprecision parameter delta used in delta-decidability when it is used to verify MTL properties. We present an application of this result in the form of an algorithm that generates new constraints to the delta-decision procedure from falsification runs, which can speed up the verification run. We then establish new conditions under which robust testing, based on the robust semantics of MTL, is in fact a quasi-semidecision procedure. These results allow us to delimit what is possible with fast, robustness-based methods, accelerate (near-)exhaustive verification, and further bridge the gap between verification and simulation.

[1]  References , 1971 .

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

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

[4]  Sriram Sankaranarayanan,et al.  Probabilistic Temporal Logic Falsification of Cyber-Physical Systems , 2013, TECS.

[5]  Sriram Sankaranarayanan,et al.  A trajectory splicing approach to concretizing counterexamples for hybrid systems , 2013, 52nd IEEE Conference on Decision and Control.

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

[7]  Garvit Juniwal,et al.  Robust online monitoring of signal temporal logic , 2015, Formal Methods in System Design.

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

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

[10]  Houssam Abbas,et al.  Linear Hybrid System Falsification through Local Search , 2011, ATVA.

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

[12]  Stefan Ratschan,et al.  Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers , 2013, Journal of Automated Reasoning.

[13]  Soumitra Kumar,et al.  Sepsis and Atrial Fibrillation , 2017 .

[14]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

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

[16]  Sriram Sankaranarayanan,et al.  Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems , 2010, HSCC '10.

[17]  Sriram Sankaranarayanan,et al.  S-TaLiRo: A Tool for Temporal Logic Falsification for Hybrid Systems , 2011, TACAS.

[18]  Stefan Ratschan,et al.  Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable , 2011, MFCS.

[19]  Stefan Ratschan.  Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable , 2010, TAMC.

[20]  Insup Lee,et al.  Robust Test Generation and Coverage for Hybrid Systems , 2007, HSCC.

[21]  George J. Pappas,et al.  Robustness of temporal logic specifications for continuous-time signals , 2009, Theor. Comput. Sci..

[22]  George J. Pappas,et al.  Robustness of Temporal Logic Specifications , 2006, FATES/RV.

[23]  Alexandre Donzé,et al.  Breach, A Toolbox for Verification and Parameter Synthesis of Hybrid Systems , 2010, CAV.

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

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

[26]  KoymansRon.  Specifying real-time properties with metric temporal logic , 1990 .

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

[28]  Martin Fränzle,et al.  SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems , 2008, ATVA.

[29]  Jonathan M. Borwein,et al.  Existence Of Nearest Points In Banach Spaces , 1989, Canadian Journal of Mathematics.

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

[31]  Antoine Girard,et al.  Temporal Logic Verification Using Simulation , 2006, FORMATS.

[32]  M. Fisher,et al.  A semiclosed-loop algorithm for the control of blood glucose levels in diabetics , 1991, IEEE Transactions on Biomedical Engineering.