arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.08554eess.SYcs.SY
收藏

带有区间决策过程的马尔可夫链近似抽象(扩展版本)

Approximate Abstractions of Markov Chains with Interval Decision Processes (Extended Version)

University of L’Aquila(拉奎拉大学);University of Oxford(牛津大学)

Y. Zacchia Lun, J. Wheatley, A. D'Innocenzo, A. Abate

AI总结:

本文提出了一种新的抽象技术,用于减少大规模离散时间标记马尔可夫链的状态空间。该方法利用区间马尔可夫决策过程的语义和已有的近似概率双模拟概念。与传统抽象方法不同,本文的抽象结构考虑了抽象点,这些点不一定是从具体模型的状态空间中选取的,而是由这些状态决定的。所得到的模型在与标准马尔可夫链抽象相比时,具有更小的一步双模拟误差。我们概述了一种进行概率模型检查的方法,并展示了新方法的计算复杂性与基于近似概率双模拟的标准抽象方法相当。

摘要:

本文介绍了一种新的抽象技术,用于减少大规模离散时间标记马尔可夫链的状态空间。该抽象利用区间马尔可夫决策过程的语义和已有的近似概率双模拟概念。尽管标准抽象使用抽象点,这些点是从具体模型的状态空间中选取的,并作为一组具体状态的代表,本文的抽象结构则考虑了抽象点,这些点不一定是从具体模型的状态中选取的,而是由这些状态决定的。所得到的模型在与同样大小的标准马尔可夫链抽象相比时,具有更小的一步双模拟误差。我们概述了一种进行概率模型检查的方法,并展示了新方法的计算复杂性与基于近似概率双模拟的标准抽象方法相当。

英文摘要:

This work introduces a new abstraction technique for reducing the state space of large, discrete-time labelled Markov chains. The abstraction leverages the semantics of interval Markov decision processes and the existing notion of approximate probabilistic bisimulation. Whilst standard abstractions make use of abstract points that are taken from the state space of the concrete model and which serve as representatives for sets of concrete states, in this work the abstract structure is constructed considering abstract points that are not necessarily selected from the states of the concrete model, rather they are a function of these states. The resulting model presents a smaller one-step bisimulation error, when compared to a like-sized, standard Markov chain abstraction. We outline a method to perform probabilistic model checking, and show that the computational complexity of the new method is comparable to that of standard abstractions based on approximate probabilistic bisimulations.

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

↑