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

通过划分细化求解互模拟的时间下界

Lowerbounds for Bisimulation by Partition Refinement

Jan Friso Groote, Jan Martens, Erik. P. de Vink

AI总结:

本文研究了标号迁移系统上基于划分细化判定互模拟的算法时间下界,证明顺序算法下界为 $Ω((m+n)\log n)$,并行算法为 $Ω(n)$,并指出现有线性技术无法加速通用算法。

摘要:

我们给出了在使用划分细化的标号迁移系统上判定互模拟的顺序和并行算法的时间下界。对于顺序算法,下界为 $Ω((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu n)$;对于并行算法,下界为 $Ω(n)$,其中 $n$ 是状态数,$m$ 是迁移数。这些下界是通过对确定性迁移系统族进行分析得到的,在顺序情况下最终包含两个动作,而在并行算法中包含一个动作。对于具有一个动作的确定性迁移系统,可以使用与划分细化根本不同的技术来顺序判定互相似性。特别地,Paige、Tarjan 和 Bonic 针对这种特定情况给出了一个线性算法。我们展示了,利用 oracle 的概念,这种方法对于开发更快的判定互相似性的通用算法并无帮助。对于并行算法,也存在可以应用这些技术的类似情况。

英文摘要:

We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms this is $Ω((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu n)$ and for parallel algorithms this is $Ω(n)$, where $n$ is the number of states and $m$ is the number of transitions. The lowerbounds are obtained by analysing families of deterministic transition systems, ultimately with two actions in the sequential case, and one action for parallel algorithms. For deterministic transition systems with one action, bisimilarity can be decided sequentially with fundamentally different techniques than partition refinement. In particular, Paige, Tarjan, and Bonic give a linear algorithm for this specific situation. We show, exploiting the concept of an oracle, that this approach is not of help to develop a faster generic algorithm for deciding bisimilarity. For parallel algorithms there is a similar situation where these techniques may be applied, too.

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

↑