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

区间马尔可夫链中ω-正则性质可满足性的界限

Satisfiability Bounds for ω-regular Properties in Interval-valued Markov Chains

Georgia Institute of Technology(佐治亚理工学院)

Maxence Dutreix, Samuel Coogan

AI总结:

本文提出在区间马尔可夫链中计算ω-正则性质可满足性界限的算法,通过扩展自动机理论并引入达索夫自动机,结合可达性问题求解,建立上下界计算方法。

摘要:

我们推导出一种算法,用于计算区间马尔可夫链(IMC)中任意ω-正则性质的可满足性界限。IMC通过为状态间转移概率分配可能值范围扩展了常规马尔可夫链。我们扩展了马尔可夫链中ω-正则性质验证的自动机构理论,使其适用于IMC。任何ω-正则性质均可通过确定性拉宾自动机(DRA)表示,其接受条件由拉宾对表达。先前研究表明,计算满足给定ω-正则性质的概率等同于求解马尔可夫链与相应DRA乘积中的可达性问题。我们同样定义了IMC与DRA的乘积概念。然后证明,在乘积IMC中存在特定的转移值分配,可生成最大的非接受状态集。随后证明,通过求解该改进版本的原始乘积IMC的可达性问题,可得到下界。我们为计算具有一个拉宾对的乘积IMC的可满足性上界推导出类似方法。对于具有多个拉宾对的乘积IMC,我们证明计算可满足性上界等同于对原性质补集的可满足性下界。提出了一种搜索算法,用于寻找乘积IMC中最大接受和非接受状态集。最后,我们在案例研究中展示了我们的发现。

英文摘要:

We derive an algorithm to compute satisfiability bounds for arbitrary ω-regular properties in an Interval-valued Markov Chain (IMC) interpreted in the adversarial sense. IMCs generalize regular Markov Chains by assigning a range of possible values to the transition probabilities between states. In particular, we expand the automata-based theory of ω-regular property verification in Markov Chains to apply it to IMCs. Any ω-regular property can be represented by a Deterministic Rabin Automata (DRA) with acceptance conditions expressed by Rabin pairs. Previous works on Markov Chains have shown that computing the probability of satisfying a given ω-regular property reduces to a reachability problem in the product between the Markov Chain and the corresponding DRA. We similarly define the notion of a product between an IMC and a DRA. Then, we show that in a product IMC, there exists a particular assignment of the transition values that generates a largest set of non-accepting states. Subsequently, we prove that a lower bound is found by solving a reachability problem in that refined version of the original product IMC. We derive a similar approach for computing a satisfiability upper bound in a product IMC with one Rabin pair. For product IMCs with more than one Rabin pair, we establish that computing a satisfiability upper bound is equivalent to lower-bounding the satisfiability of the complement of the original property. A search algorithm for finding the largest accepting and non-accepting sets of states in a product IMC is proposed. Finally, we demonstrate our findings in a case study.

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

↑