Year: 2026
Type: preprint
Abstract: Fuzzy minimax nets were recently introduced as a tool for computing the greatest fuzzy bisimulation and simulation between two finite fuzzy graph-based structures. In this work, we provide an efficient algorithm with time complexity $O(m + n + l\log{l})$ for computing the greatest correct marking of a finite fuzzy minimax net over the Gödel structure, where $n$, $m$, and $l$ denote the numbers of nodes, positive edges, and distinct fuzzy values used in the net, respectively. Building on this result, we derive the first algorithm with time complexity $O((m+n)n)$ for computing the greatest fuzzy directed simulation between two finite fuzzy graphs over the Gödel structure, where $n$ and $m$ denote the total numbers of vertices and positive edges, respectively, in the input graphs.
Source: arXiv (Cornell University)
Author: Nguyen, Linh Anh
Institutions: Trường ĐH Nguyễn Tất Thành, University of Warsaw
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7169797341
Cites:
Cited by:
Related to: