Light-weight hybrid model checking facilitating online prediction of temporal properties

We address the question of system-in-the-loop monitoring of dynamic systems with a moderately fast sampling rate. The objective is, given a partial time series of (possibly inexact) data obtained from online measurements of observable variables of the system, to safely predict the truth value of a Linear-time Temporal Logic (LTL) formula including future modalities, in realtime while the system is evolving. We therefore develop an online monitoring tool providing early warning based on safe extrapolation from system history, where the history is recorded as a time series of observations and, in order to achieve sound predictions, the future is safely approximated using differential equations and other constraints pertinent to the system dynamics. The systems considered are heterogeneous systems from the automotive domain, featuring a seamless integration of cognitive models for human behavior, traffic models, model-based designs of driver assistance systems, and models describing the dynamic behavior of the car. Tool support for online monitoring of hybrid systems with respect to requirements expressed using temporal logics has previously been studied in [NM07], where a property based tool (named ATM) for monitoring analogue systems is described. The properties are expressed as formulae of STL/PSL, an extension of MITL [AFH96] and STL [MN04]. A serious limitation of AST, however, is that formulae are just interpreted over a history of past events, forcing online monitoring to fall behind real-time. Our work can be seen as an extension of that in the sense that we interpret formulae over infinite extensions of the monitored traces, where the future events are safely approximated using laws describing the dynamics of the system. To arrive at useful safe overapproximations of the possible infinite extensions of the sampled finite trace, interval constraint propagation [BG06] is used to efficiently estimate ranges of observations in the bounded future based on ordinary differential equations (ODE) governing parts of the system dynamics, thereby exploiting a mean-value form of the ODEs akin to that used in the hybrid-system model-checker HSolver [RS05]. An offline preprocessing step is used to permit efficient online computation of estimates covering the unbounded future. Following the intuition that dynamical systems gradually turn their state to the good or bad, we let our monitor output a quantitative figure in the form of a numerical interval providing a safe estimate of how severe a property violation can be, instead of a qualitative yes/no answer. To this end, we resort to a robust semantics for LTL, where the meaning of a formula is the degree of accuracy within which it is satisfied. This notion of robustness originates from [Rat00], where it is applied to arithmetic first-order constraints, and has been lifted to the linear-time temporal logics Duration Calculus [FH05] and LTL [FLS08]. We adopt the latter and extend it to an interval-valued interpretation over interval-valued traces, thus being able to accommodate inexact measurements as well as not fully determined extrapolated values in the semantics.

[1]  Dejan Nickovic,et al.  Monitoring Temporal Properties of Continuous Signals , 2004, FORMATS/FTRTFT.

[2]  Timothy J. Hickey,et al.  Rigorous Modeling of Hybrid Systems Using Interval Arithmetic Constraints , 2004, HSCC.

[3]  Martin Fränzle,et al.  A Robust Interpretation of Duration Calculus , 2005, ICTAC.

[4]  Martin Fränzle,et al.  Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic , 2008, CPAIOR.

[5]  Stefan Ratschan,et al.  Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving , 2000, J. Univers. Comput. Sci..

[6]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[7]  Frédéric Benhamou,et al.  Heterogeneous Constraint Solving , 1996, ALP.

[8]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

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

[10]  M. H. van Emden,et al.  Interval arithmetic: From principles to implementation , 2001, JACM.

[11]  Axel Legay,et al.  Model Checking Quantitative Linear Time Logic , 2008, QAPL.

[12]  A. Neumaier Interval methods for systems of equations , 1990 .

[13]  Pascal Van Hentenryck,et al.  CLP(Intervals) Revisited , 1994, ILPS.

[14]  Dejan Nickovic,et al.  AMT: A Property-Based Monitoring Tool for Analog Systems , 2007, FORMATS.

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

[16]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, JACM.

[17]  Dejan Nickovic,et al.  Checking Temporal Properties of Discrete, Timed and Continuous Behaviors , 2008, Pillars of Computer Science.

[18]  Stefan Ratschan,et al.  Constraints for Continuous Reachability in the Verification of Hybrid Systems , 2006, AISC.

[19]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.