通过转移算子视角的随机系统记忆依赖抽象
Memory-dependent abstractions of stochastic systems through the lens of transfer operators
AI总结:
本文提出基于转移算子的记忆依赖抽象方法,用于形式验证随机系统的近似误差量化。
摘要:
随着安全关键的自主系统在不确定环境中日益普及,对于随机模型的形式验证数学方法需求日益增加。为了形式验证随机系统的性质,近年来基于离散有限马尔可夫近似(即抽象)的方法迅速发展。这些方法出现在两种情境中:要么只拥有对底层连续随机过程的不完全离散观测,或者原始系统过于复杂难以分析,因此需要将原始系统的连续状态空间划分为可处理的有限状态模型。在两种情况下,抽象都是对离散随机过程的近似,这种近似源于底层连续过程的离散化。抽象是马尔可夫的,而离散过程不是(尽管原始过程是),这导致了近似误差。为了考虑非马尔可夫性,我们引入了随机系统的记忆依赖抽象,以捕捉具有记忆效应的动力学。我们的贡献是双重的。首先,我们基于转移算子提供了一种记忆依赖抽象的正式主义。其次,我们通过上界量化近似误差,即真实连续状态分布与离散近似之间的总变差距离。
英文摘要:
With the increasing ubiquity of safety-critical autonomous systems operating in uncertain environments, there is a need for mathematical methods for formal verification of stochastic models. Towards formally verifying properties of stochastic systems, methods based on discrete, finite Markov approximations -- abstractions -- thereof have surged in recent years. These are found in contexts where: either a) one only has partial, discrete observations of the underlying continuous stochastic process, or b) the original system is too complex to analyze, so one partitions the continuous state-space of the original system to construct a handleable, finite-state model thereof. In both cases, the abstraction is an approximation of the discrete stochastic process that arises precisely from the discretization of the underlying continuous process. The fact that the abstraction is Markov and the discrete process is not (even though the original one is) leads to approximation errors. Towards accounting for non-Markovianity, we introduce memory-dependent abstractions for stochastic systems, capturing dynamics with memory effects. Our contribution is twofold. First, we provide a formalism for memory-dependent abstractions based on transfer operators. Second, we quantify the approximation error by upper bounding the total variation distance between the true continuous state distribution and its discrete approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。