arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1410.0833cs.DScs.LO
收藏

Parity和Streett目标的改进算法

Improved Algorithms for Parity and Streett objectives

Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer

摘要:

在图和博弈图中计算奇偶性目标和Streett目标的获胜集是计算机辅助验证中的中心问题,其应用于具有强公平条件的封闭系统的验证、开放系统的验证、检查接口兼容性、规范的良构性以及反应系统的合成。我们展示了如何计算$n$顶点上的获胜集,用于(1)在时间$O(n^{5/2})$中的博弈图中的奇偶校验-3(又名一对Streett)目标和(2)在时间$O(n^2 + nk \log n)$中的图中的k对Streett目标。对于这两个问题,这给出了更快的算法密集图,并代表了第一次改善渐近运行时间在15年。

英文摘要:

The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on $n$ vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time $O(n^{5/2})$ and for (2) k-pair Streett objectives in graphs in time $O(n^2 + nk \log n)$. For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.

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

↑