...
首页> 外文期刊>Fuzzy sets and systems >Characterization and computation of approximate bisimulations for fuzzy automata
【24h】

Characterization and computation of approximate bisimulations for fuzzy automata

机译:Characterization and computation of approximate bisimulations for fuzzy automata

获取原文
获取原文并翻译 | 示例
           

摘要

? 2022 Elsevier B.V.Approximate bisimulations for fuzzy automata have recently drawn attention of researches, since they allow to correlate different fuzzy automata which behave equivalently only to the chosen degree. This is of a particular interest in the state reduction of fuzzy automata, since it allows us to find a fuzzy automaton with a much smaller number of states and a slightly different behaviour from the original fuzzy automaton. The contribution of this paper is twofold. First, we study special types of approximate bisimulations which allow us to correlate all elements from both sets of states of two fuzzy automata. We show their properties, and particularly that they induce the so-called approximate isomorphism between the corresponding factor fuzzy automata. We pay a special attention to similarities and differences between homotypic and heterotypic approximate bisimulations. Second, we provide an efficient algorithm with the complexity O((m+n)n) for computing the greatest λ-approximate bisimulation between two finite fuzzy automata over the G?del structure (if it exists), where λ is the threshold for approximation, n is the number of states and m is the number of non-zero transitions of the automata. This algorithm gives a great reduction of complexity when compared to the previously developed one, which has the complexity O(mn5). We also design an algorithm with the complexity O((m+n)n) for computing the greatest λ∈[0,1] such that there exists a λ-approximate bisimulation between two given finite fuzzy automata over the G?del structure.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号