Computing the Fuzzy Partition Corresponding to the Greatest Fuzzy Auto-Bisimulation of a Fuzzy Graph-Based Structure

by   Linh Anh Nguyen, et al.

Fuzzy graph-based structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models, fuzzy social networks and fuzzy interpretations in fuzzy description logics are useful in various applications. Given two states, two actors or two individuals x and x' in such structures G and G', respectively, the similarity degree between them can be defined to be Z(x,x'), where Z is the greatest fuzzy bisimulation between G and G' w.r.t. some t-norm-based fuzzy logic. Such a similarity measure has the Hennessy-Milner property of fuzzy bisimulations as a strong logical foundation. A fuzzy bisimulation between a fuzzy structure G and itself is called a fuzzy auto-bisimulation of G. The greatest fuzzy auto-bisimulation of an image-finite fuzzy graph-based structure is a fuzzy equivalence relation. It is useful for classification and clustering. In this paper, we design an efficient algorithm with the complexity O((mlogl + n)logn) for computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a finite fuzzy labeled graph G under the Gödel semantics, where n, m and l are the number of vertices, the number of non-zero edges and the number of different fuzzy degrees of edges of G, respectively. Our notion of fuzzy partition is novel, defined only for finite sets with respect to the Gödel t-norm, with the aim to facilitate the computation of the greatest fuzzy auto-bisimulation. By using that algorithm, we also provide an algorithm with the complexity O(m·logl·logn + n^2) for computing the greatest fuzzy bisimulation between two finite fuzzy labeled graphs under the Gödel semantics. This latter algorithm is better (has a lower complexity order) than the previously known algorithms for the considered problem. Our algorithms can be restated for the other mentioned fuzzy graph-based structures.


page 1

page 2

page 3

page 4


Computing Crisp Bisimulations for Fuzzy Structures

Fuzzy structures such as fuzzy automata, fuzzy transition systems, weigh...

Logical Characterizations of Fuzzy Bisimulations in Fuzzy Modal Logics over Residuated Lattices

There are two kinds of bisimulation, namely crisp and fuzzy, between fuz...

Computing Crisp Simulations and Crisp Directed Simulations for Fuzzy Graph-Based Structures

Like bisimulations, simulations and directed simulations are used for an...

The Application of Energy and Laplacian Energy of Hesitancy Fuzzy Graph Based on Similarity Measures in Decision Making Problems

In this article, a new hesitancy fuzzy similarity measure is defined and...

Auto-FuzzyJoin: Auto-Program Fuzzy Similarity Joins Without Labeled Examples

Fuzzy similarity join is an important database operator widely used in p...

Minimizing Fuzzy Interpretations in Fuzzy Description Logics by Using Crisp Bisimulations

The problem of minimizing finite fuzzy interpretations in fuzzy descript...

Graph Fuzzy System: Concepts, Models and Algorithms

Fuzzy systems (FSs) have enjoyed wide applications in various fields, in...

Please sign up or login with your details

Forgot password? Click here to reset