HyLTL: a temporal logic for model checking hybrid systems

  title={HyLTL: a temporal logic for model checking hybrid systems},
  author={Davide Bresolin},
  • D. Bresolin
  • Published in HAS 22 August 2013
  • Computer Science
The model-checking problem for hybrid systems is a well known challenge in the scientific community. Most of the existing approaches and tools are limited to safety properties only, or operates by transforming the hybrid system to be verified into a discrete one, thus loosing information on the continuous dynamics of the system. In this paper we present a logic for specifying complex properties of hybrid systems called HyLTL, and we show how it is possible to solve the model checking problem by… 

Figures from this paper

STL Model Checking of Continuous and Hybrid Systems

This work presents a method solving the problem of formally verifying an STL formula for continuous and hybrid system models, which exhibit uncountably many traces, through leveraging the representation of the abstraction.

Verifying LTL Properties of Hybrid Systems with K-Liveness

K-Liveness is extended to deal with LTL for hybrid systems and it is proved that the new reduction is complete for a class of rectangular hybrid automata, in the sense that the LTL property holds if and only if there exists K such that the accepting condition is visited at most K times.

A Toolchain for Verifying Safety Properties of Hybrid Automata via Pattern Templates

A toolchain that facilitates the integration of formal verification techniques into model-based design and its focus is on hybrid automata as the model and on reachability analysis as the method.

Towards verification of hybrid systems in a foundational proof assistant

A TLA-inspired formalism in Coq is defined and used to verify two Quadcopter modules: the first limits the quadcopter's velocity and the second limits its altitude, and they worked as intended.

Formal Feature Interpretation of Hybrid Systems

An improved method for the interpretation of features over hybrid automata models is described and it is demonstrated how satisfiability modulo theory solvers can be used for extracting behavioral traces corresponding to corner cases of a feature.

HRELTL: A temporal logic for hybrid systems

Formal Analysis of Hybrid Systems Using Feature Indented Assertions

A methodology for abstract interpretation of features over hybrid automata models is described, leveraging reachability solvers for extracting feature ranges formally and how Satisfiability Modulo Theory (SMT) solvers can be used for extracting behavioural traces corresponding to corner cases of a feature are demonstrated.

Trace-Checking CPS Properties: Bridging the Cyber-Physical Gap

The Hybrid Logic of Signals (HLS) is proposed, a logic-based language that allows the specification of complex CPS requirements, and ThEodorE, an efficient SMT-based trace-checking procedure that reduces the problem of checking a CPS requirement over an execution trace, to checking the satisfiability of an SMT formula.

dTL2: Differential Temporal Dynamic Logic with Nested Temporalities for Hybrid Systems

A semantics and a proof system are provided for the logic dTL2 and its usefulness for nontrivial temporal properties of hybrid systems is shown, solving an open problem formulated in previous work.

Formal Verification of Cyber-Physical Systems in the Industrial Model-Based Design Process. (Vérification formelle des systèmes cyber-physiques dans le processus industriel de la conception basée sur modèle)

This thesis aims to facilitate the integration of formal verification into the industrial model-based design process by providing a model transformation methodology and an approach to encode rich formal specifications so that they can be interpreted by tools for reachability.



Simple on-the-fly automatic verification of linear temporal logic

A tableau-based algorithm for obtaining an automaton from a temporal logic formula that can be constructed simultaneously with, and guided by, the generation of the model, and which can be used in model checking in an “on-the-fly” fashion.

KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)

This work integrates real quantifier elimination following an iterative background closure strategy to overcome the complexity of real arithmetic and implements a generalized free-variable sequent calculus and automatic proof strategies that decompose the hybrid system specification symbolically.

The Algorithmic Analysis of Hybrid Systems

Requirements Validation for Hybrid Systems

The HRELTL logic is proposed, that extends the Linear-time Temporal Logic with Regular Expressions (RELTL) with hybrid aspects, and it is shown that the satisfiability problem for the linear fragment can be reduced to an equi-satisfiable problem for RELTL.

What's decidable about hybrid automata?

It is proved that the reachability problem is undecidable for timed automata augmented with a single stopwatch, and an (optimal) PSPACE reachability algorithm is given for the case of initialized rectangular automata.

Hybrid Systems in TLA+

TLA+ is used to define operators for specifying the temporal behavior of physical components obeying integral equations of evolution, together with previously defined operators for describing timing constraints, are used to specify a toy gas burner introduced by Ravn, Rischel, and Hansen.

Safety verification of hybrid systems by constraint propagation-based abstraction refinement

This paper starts from a classical method that uses interval arithmetic to check whether trajectories can move over the boundaries in a rectangular grid and improves it by developing an additional refinement step that employs interval-constraint propagation to add information to the abstraction without introducing new grid elements.

Assume–guarantee verification of nonlinear hybrid systems with Ariadne

This paper will show how the approximation capabilities of Ariadne can be used to verify complex hybrid systems, adopting an assume–guarantee reasoning approach.

SpaceEx: Scalable Verification of Hybrid Systems

We present a scalable reachability algorithm for hybrid systems with piecewise affine, non-deterministic dynamics. It combines polyhedra and support function representations of continuous sets to

KRONOS: a verification tool for real-time systems

  • S. Yovine
  • Computer Science
    International Journal on Software Tools for Technology Transfer
  • 1997
The main purpose of this paper is to explain how to use Kronos, a tool for formally checking whether a real-time system meets its requirements. Kronos is founded on the theory of timed automata and