Complexity of computing greatest fuzzy auto-bisimulations
Determine whether the greatest fuzzy auto-bisimulation of a finite fuzzy Kripke model over the product or Łukasiewicz residuated lattice can be computed in polynomial time or whether computing it is NP-hard.
References
As mentioned above, the time complexity of computing the greatest fuzzy Φ-auto-bisimulation of a finite fuzzy Kripke model over the product or Łukasiewicz structure remains an open problem: it is not known whether this problem can be solved in polynomial time or is NP-hard.
— Minimizing fuzzy Kripke models over residuated lattices
(2610.13010 - Nguyen, 9 Oct 2026) in Section 6, Discussion and conclusions, p. 27