arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1507.00509eess.SYcs.SY
收藏

动态贝叶斯网络作为结构化随机过程的正式抽象

Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes

Max Planck Institute for Software Systems (MPI-SWS)(马克斯·普朗克软件系统研究所);Department of Computer Science, University of Oxford(牛津大学计算机科学系)

Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate, Rupak Majumdar

AI总结:

本文提出通过动态贝叶斯网络对离散时间马尔可夫过程进行抽象,以提高效率,同时提供误差界和更精确的抽象方法。

摘要:

我们研究了离散时间马尔可夫过程在一般(不可数)状态空间上的有限时间概率不变性问题。我们计算离散时间、有限状态马尔可夫链作为一般马尔可夫过程的正式抽象。我们的抽象方法与现有方法不同,首先利用底层马尔可夫过程的结构,分别对每个维度计算抽象;其次采用动态贝叶斯网络(DBN)作为抽象的紧凑表示。相比之下,现有方法显式表示和存储(指数级大的)马尔可夫链,导致内存需求大,限制应用到维度小于一半的模型。我们展示了如何构造满足驱动过程噪声独立性假设的马尔可夫过程的DBN抽象。我们计算了抽象相对于概率不变性属性的误差界;维度依赖的抽象使误差界比现有方法更精确。此外,我们展示了如何利用因子图和DBN的求和-乘积算法解决有限时间概率不变性问题。共同,基于DBN的表示和算法可以显著比显式表示的马尔可夫链更高效地抽象和验证结构化马尔可夫过程。

英文摘要:

We study the problem of finite-horizon probabilistic invariance for discrete-time Markov processes over general (uncountable) state spaces. We compute discrete-time, finite-state Markov chains as formal abstractions of general Markov processes. Our abstraction differs from existing approaches in two ways. First, we exploit the structure of the underlying Markov process to compute the abstraction separately for each dimension. Second, we employ dynamic Bayesian networks (DBN) as compact representations of the abstraction. In contrast, existing approaches represent and store the (exponentially large) Markov chain explicitly, which leads to heavy memory requirements limiting the application to models of dimension less than half, according to our experiments. We show how to construct a DBN abstraction of a Markov process satisfying an independence assumption on the driving process noise. We compute a guaranteed bound on the error in the abstraction w.r.t.\ the probabilistic invariance property; the dimension-dependent abstraction makes the error bounds more precise than existing approaches. Additionally, we show how factor graphs and the sum-product algorithm for DBNs can be used to solve the finite-horizon probabilistic invariance problem. Together, DBN-based representations and algorithms can be significantly more efficient than explicit representations of Markov chains for abstracting and model checking structured Markov processes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑