通过块分解分析线性混合系统的可达性
Reachability analysis of linear hybrid systems via block decomposition
AI总结：
本文提出了一种通过块分解改进线性混合系统可达性分析的方法，通过在低维状态空间中进行计算，提高了连续和离散后操作的效率，并在多个挑战性基准上展示了其潜力。
摘要：
可达性分析旨在识别系统在给定时间范围内可达的状态。这项任务对于线性混合系统来说计算上非常昂贵。可达性分析通过迭代应用连续和离散后操作来计算根据连续和离散动态可达的状态。在本文中，我们改进了这两种操作并确保大部分涉及的计算在低维状态空间中进行。特别是，我们通过在高维状态空间中仅对后续应用离散后操作相关的时间区间进行计算来改进连续后操作。此外，新的离散后操作通过利用所考虑转换的守卫和赋值的结构进行低维计算。我们通过一系列具有挑战性的基准来展示我们方法的潜力。
英文摘要：
Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this paper, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
