arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.01768cs.FLcs.LO
收藏

计算概率自动机的概率互模拟距离

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata

Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel

AI总结:

本文提出一种基于简单随机博弈的策略迭代算法,用于高效计算概率自动机的概率互模拟距离,并证明该距离可界定状态满足ω-正则性质的概率差。

摘要:

Deng等人提出的概率互模拟距离已被提议作为Segala和Lynch的概率互模拟对概率自动机的一种稳健的定量推广。在本文中,我们将互模拟距离刻画为一个简单随机博弈的解。该刻画为我们提供了一种通过在这些博弈上应用Condon的简单策略迭代来计算距离的算法。然而,Condon方法的正确性依赖于博弈是停止的假设。我们的博弈通常可能不是停止的,但我们能够证明这类扩展博弈的终止性。文献中已经提出了其他计算这些距离的算法,其复杂度在$\textbf{UP} \cap \textbf{coUP}$和\textbf{PPAD}中。尽管具有理论相关性,这些算法在实践中效率低下。据我们所知,我们的算法是第一个实用的解决方案。上述概率互模拟距离的刻画关键使用了Mémoli提出的Hausdorff距离的对偶表示。作为额外贡献,在本文中我们表明Mémoli的结果也可用于证明互模拟距离界定了两个状态满足任意$\omega$-正则性质(例如以LTL公式表达)的最大(或最小)概率之差。

英文摘要:

The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of the bisimilarity distance as the solution of a simple stochastic game. The characterization gives us an algorithm to compute the distances by applying Condon's simple policy iteration on these games. The correctness of Condon's approach, however, relies on the assumption that the games are stopping. Our games may be non-stopping in general, yet we are able to prove termination for this extended class of games. Already other algorithms have been proposed in the literature to compute these distances, with complexity in $\textbf{UP} \cap \textbf{coUP}$ and \textbf{PPAD}. Despite the theoretical relevance, these algorithms are inefficient in practice. To the best of our knowledge, our algorithm is the first practical solution. The characterization of the probabilistic bisimilarity distance mentioned above crucially uses a dual presentation of the Hausdorff distance due to Mémoli. As an additional contribution, in this paper we show that Mémoli's result can be used also to prove that the bisimilarity distance bounds the difference in the maximal (or minimal) probability of two states to satisfying arbitrary $ω$-regular properties, expressed, eg., as LTL formulas.

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

↑