Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
From MaRDI portal
Cites work
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Approximate bisimulations for fuzzy-transition systems
- Bisimulations for fuzzy transition systems revisited
- Computing crisp bisimulations for fuzzy structures
- Computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a fuzzy graph-based structure under the Gödel semantics
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- Fast Algorithms for Finding Nearest Common Ancestors
- Fuzzy equivalence relations and their equivalence classes
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 2199279 (Why is no real title available?)
- Lattice-valued simulations for quantitative transition systems
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Metamathematics of fuzzy logic
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Similarity relations, fuzzy partitions, and fuzzy orderings
- Simulation for lattice-valued doubly labeled transition systems
- The construction of possibility measures from samples on \(\mathfrak T\)-semi-partitions
- Three Partition Refinement Algorithms
This page was built for publication: Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6905682)
