混杂系统中LTL公式p到q的证明
Certifying the LTL Formula p Until q in Hybrid Systems
摘要:
本文给出了混杂系统满足形式为p ~ q的线性时态逻辑(LTL)公式(记为$p \mathcal{U} q$)的充分条件.粗略地说,满足公式$p \mathcal{U} q$意味着最初满足命题p的解保持满足该命题,直到满足命题q。为了证明这样一个公式,连接到不变性的概念,如条件不变性(CI)和最终条件不变性(ECI),以及有限时间吸引性(FTA)的建立。其结果是,充分条件涉及的混杂系统的数据和适当的选择的Lyapunov函数,如障碍函数,推导出。所考虑的混杂系统中给出的微分和差分包含,其中捕获的连续和离散的动态存在于同一系统中,分别。整个文件的例子说明了结果。
英文摘要:
In this paper, we propose sufficient conditions to guarantee that a linear temporal logic (LTL) formula of the form p Until q, denoted by $p \mathcal{U} q$, is satisfied for a hybrid system. Roughly speaking, the formula $p \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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。