共 50 条
Approximate Bisimulations for Fuzzy Automata Over Complete Heyting Algebras
被引:15
|作者:
Stanimirovic, Stefan
[1
]
Micic, Ivana
[1
]
Ciric, Miroslav
[1
]
机构:
[1] Univ Nis, Fac Sci & Math, Nish 18000, Serbia
关键词:
lambda-Approximate bisimulations;
bisimulation relation;
fuzzy automata;
state reduction;
MODEL CHECKING;
LOGICAL CHARACTERIZATIONS;
COMPUTATION;
MINIMIZATION;
SIMULATION;
D O I:
10.1109/TFUZZ.2020.3039968
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
In this article, we define lambda-approximate simulations and bisimulations for fuzzy automata over complete Heyting algebras. The value lambda presents the degree of language similarity or equality between observed fuzzy automata. Algorithms for computing the greatest lambda-approximate simulations and bisimulations are given. We show that lambda-approximate simulations and bisimulations on a fuzzy automaton can be effectively used for factorization of fuzzy automata. We present the algorithm that splits the interval of the degrees of language similarity or equality into subintervals with the same minimal corresponding factor fuzzy automata.
引用
收藏
页码:437 / 447
页数:11
相关论文