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

图和MDP中Streett目标的近线性时间算法

Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs

Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil

摘要:

基本的模型检查问题,作为输入的模型和规格,要求的算法验证模型是否满足规格。反应系统的两个经典模型是图和马尔可夫决策过程(MDP)。反应式系统验证中的一个基本规范形式主义是强公平性(又称Streett)目标,其中给定不同类型的请求和相应的授权,要求是对于每种类型,如果请求事件无限频繁地发生,则相应的授权事件也必须无限频繁地发生。所有的Ω正则目标都可以表示为Streett目标,因此它们在验证中是规范的。考虑具有n个顶点、m条边和a个具有k对的Streett目标的图/MDP,并且让b表示请求和授权的集合的Streett目标的描述的大小。目前最著名的算法的问题需要时间$O(min(n^2, m \sqrt{m \log n}) + b \log n)$。在这项工作中,我们提出了随机的近线性时间算法,与预期的运行时间$\widetilde{O}(m + b)$,其中的$\widetilde{O}$符号隐藏多对数因子。我们的随机算法在输入的大小上是近线性的,因此最佳的多对数因子。

英文摘要:

The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time $O(min(n^2, m \sqrt{m \log n}) + b \log n)$. In this work, we present randomized near-linear time algorithms, with expected running time $\widetilde{O}(m + b)$, where the $\widetilde{O}$ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors.

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

↑