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

交替加细关系的快速算法

Faster Algorithms for Alternating Refinement Relations

Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath

摘要:

反应式系统的形式化设计和分析中的一个中心问题是精化的概念,它询问实现的所有行为是否都被规范所允许。对行为的局部解释导致了模拟的概念。交替变迁系统(ATS)为复合反应系统提供了一种通用模型,ATS的模拟关系称为交替模拟。公平转移系统的模拟关系称为公平模拟。在这项工作中,我们的主要贡献如下:(1)我们提出了一个改进的算法,公平模拟与Büchi公平性约束,我们的算法需要$O(n^3 \cdot m)$时间相比,以前已知的$O(n^6)$时间算法,其中$n$是状态的数量和$m$是转换的数量。(2)我们提出了一个基于游戏的算法交替模拟,需要$O(m^2)$ -时间相比,以前已知的$O((n \cdot m)^2)$ -时间算法,其中$n$是状态的数量和$m$是过渡关系的大小。(3)我们提出了一个迭代算法交替模拟匹配的时间复杂度的游戏为基础的算法,但更有效的空间比游戏为基础的算法。

英文摘要:

One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires $O(n^3 \cdot m)$ time as compared to the previous known $O(n^6)$-time algorithm, where $n$ is the number of states and $m$ is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires $O(m^2)$-time as compared to the previous known $O((n \cdot m)^2)$-time algorithm, where $n$ is the number of states and $m$ is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.

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

↑