English

Certifying the LTL Formula p Until q in Hybrid Systems

Systems and Control 2022-08-18 v5 Systems and Control

Abstract

In this paper, we propose sufficient conditions to guarantee that a linear temporal logic (LTL) formula of the form p Until q, denoted by pUqp \mathcal{U} q, is satisfied for a hybrid system. Roughly speaking, the formula pUqp \mathcal{U} q is satisfied means that the solutions, initially satisfying proposition p, keep satisfying this proposition until proposition q is satisfied. To certify such a formula, connections to invariance notions such as conditional invariance (CI) and eventual conditional invariance (ECI), as well as finite-time attractivity (FTA) are established. As a result, sufficient conditions involving the data of the hybrid system and an appropriate choice of Lyapunov-like functions, such as barrier functions, are derived. The considered hybrid system is given in terms of differential and difference inclusions, which capture the continuous and the discrete dynamics present in the same system, respectively. Examples illustrate the results throughout the paper.

Cite

@article{arxiv.2106.06455,
  title  = {Certifying the LTL Formula p Until q in Hybrid Systems},
  author = {Hyejin Han and Mohamed Maghenem and Ricardo G. Sanfelice},
  journal= {arXiv preprint arXiv:2106.06455},
  year   = {2022}
}

Comments

21 pages. The technical report accompanying "Certifying the LTL Formula p Until q in Hybrid Systems" submitted to IEEE Transactions on Automatic Control, 2021

R2 v1 2026-06-24T03:06:26.538Z