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

非确定性模糊迁移系统互模拟计算的高效算法

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems

Linh Anh Nguyen

AI总结:

本文针对非确定性模糊迁移系统,提出计算最大清晰互模拟划分和Gödel语义下最大模糊互模拟紧致划分的高效算法,将时间复杂度从四次方量级显著降至近线性对数量级,并引入带模糊状态标签的扩展模型。

摘要:

模糊迁移系统为建模和分析现实场景中普遍存在的固有不确定性与不精确性提供了稳健框架。作为其扩展,非确定性模糊迁移系统(NFTSs)已在大量工作中得到研究。Wu等人(2018)给出了一种计算有限NFTS $\mathcal{S} = \langle S, A, δ\rangle$ 最大清晰互模拟的算法,在假设 $|δ| \geq |S|$ 下时间复杂度为 $O(|S|^4 \cdot |δ|^2)$ 量级。Qiao等人(2023)给出了一种在Gödel语义下计算有限NFTS $\mathcal{S}$ 最大模糊互模拟的算法,在假设 $|δ| \geq |S|$ 下时间复杂度为 $O(|S|^4 \cdot |δ|^2 \cdot l)$ 量级,其中 $l$ 是 $\mathcal{S}$ 中使用的模糊值数量加1。在本工作中,我们提供了高效算法,用于计算有限NFTS $\mathcal{S}$ 的最大清晰互模拟所对应的划分,以及在Gödel语义下 $\mathcal{S}$ 的最大模糊互模拟所对应的紧致模糊划分。它们的时间复杂度为 $O((size(δ) \log{l} + |S|) \log{(|S| + |δ|)})$ 量级,其中 $l$ 是 $\mathcal{S}$ 中使用的模糊值数量加2。当 $|δ| \geq |S|$ 时,该量级在 $O(|S| \cdot |δ| \cdot \log^2{|δ|})$ 以内。将时间复杂度从 $O(|S|^4 \cdot |δ|^2)$ 和 $O(|S|^4 \cdot |δ|^2 \cdot l)$ 降低到 $O(|S| \cdot |δ| \cdot \log^2{|δ|})$ 是本文的重要贡献。此外,我们引入了非确定性模糊带标签迁移系统,该系统以模糊状态标签扩展NFTSs,并定义并给出了它们之间模拟与互模拟的结果。

英文摘要:

Fuzzy transition systems offer a robust framework for modeling and analyzing systems with inherent uncertainties and imprecision, which are prevalent in real-world scenarios. As their extension, nondeterministic fuzzy transition systems (NFTSs) have been studied in a considerable number of works. Wu et al. (2018) provided an algorithm for computing the greatest crisp bisimulation of a finite NFTS $\mathcal{S} = \langle S, A, δ\rangle$, with a time complexity of order $O(|S|^4 \cdot |δ|^2)$ under the assumption that $|δ| \geq |S|$. Qiao {\em et al.} (2023) provided an algorithm for computing the greatest fuzzy bisimulation of a finite NFTS $\mathcal{S}$ under the Gödel semantics, with a time complexity of order $O(|S|^4 \cdot |δ|^2 \cdot l)$ under the assumption that $|δ| \geq |S|$, where $l$ is the number of fuzzy values used in $\mathcal{S}$ plus 1. In this work, we provide efficient algorithms for computing the partition corresponding to the greatest crisp bisimulation of a finite NFTS $\mathcal{S}$, as well as the compact fuzzy partition corresponding to the greatest fuzzy bisimulation of $\mathcal{S}$ under the Gödel semantics. Their time complexities are of the order $O((size(δ) \log{l} + |S|) \log{(|S| + |δ|)})$, where $l$ is the number of fuzzy values used in $\mathcal{S}$ plus 2. When $|δ| \geq |S|$, this order is within $O(|S| \cdot |δ| \cdot \log^2{|δ|})$. The reduction of time complexity from $O(|S|^4 \cdot |δ|^2)$ and $O(|S|^4 \cdot |δ|^2 \cdot l)$ to $O(|S| \cdot |δ| \cdot \log^2{|δ|})$ is a significant contribution of this work. In addition, we introduce nondeterministic fuzzy labeled transition systems, which extend NFTSs with fuzzy state labels, and we define and provide results on simulations and bisimulations between them.

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

↑