基于模糊图结构的清晰模拟和清晰定向模拟计算
Computing Crisp Simulations and Crisp Directed Simulations for Fuzzy Graph-Based Structures
摘要:
与互模拟一样,模拟和定向模拟用于分析基于图的结构,如自动机,标记转换系统,链接数据网,Kripke模型和描述逻辑中的解释。模拟刻画存在模态公式类,而定向模拟刻画正模态公式类。这些观念值得研究。例如,人们可能感兴趣的是检查给定的有限自动机是否模拟另一个,或者链接的数据网中的对象是否具有另一个对象所具有的所有正属性。为了处理复杂性和不确定性,模糊图为基础的结构,而不是清晰的。在这篇文章中,我们设计了计算两个有限模糊标号图之间的最大清晰模拟和最大清晰有向模拟的有效算法,算法复杂度为$O((m+n)n)$,其中$n$是输入模糊图的顶点数,$m$是输入模糊图的非零边数.我们也适应他们计算最大的清晰模拟和最大清晰有向模拟两个有限模糊自动机。
英文摘要:
Like bisimulations, simulations and directed simulations are used for analyzing graph-based structures such as automata, labeled transition systems, linked data networks, Kripke models and interpretations in description logic. Simulations characterize the class of existential modal formulas, whereas directed simulations characterize the class of positive modal formulas. These notions are worth studying. For example, one may be interested in checking whether a given finite automaton simulates another or whether an object in a linked data network has all positive properties that another object has. To deal with vagueness and uncertainty, fuzzy graph-based structures are used instead of crisp ones. In this article, we design efficient algorithms with the complexity $O((m+n)n)$ for computing the largest crisp simulation and the largest crisp directed simulation between two finite fuzzy labeled graphs, where $n$ is the number of vertices and $m$ is the number of nonzero edges of the input fuzzy graphs. We also adapt them to computing the largest crisp simulation and the largest crisp directed simulation between two finite fuzzy automata.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。