Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
From MaRDI portal
Publication:6058014
Abstract: There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models and fuzzy interpretations in description logics. Fuzzy bisimulations between fuzzy automata over a complete residuated lattice have been introduced by 'Ciri'c et al. in 2012. Logical characterizations of fuzzy bisimulations between fuzzy Kripke models (respectively, fuzzy interpretations in description logics) over the residuated lattice [0,1] with the G"odel t-norm have been provided by Fan in 2015 (respectively, Nguyen et al. in 2020). There was the lack of logical characterizations of fuzzy bisimulations between fuzzy graph-based structures over a general residuated lattice, as well as over the residuated lattice [0,1] with the {L}ukasiewicz or product t-norm. In this article, we provide and prove logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices. The considered logics are the fuzzy propositional dynamic logic and its fragments. Our logical characterizations concern invariance of formulas under fuzzy bisimulations and the Hennessy-Milner property of fuzzy bisimulations. They can be reformulated for other fuzzy structures such as fuzzy label transition systems and fuzzy interpretations in description logics.
Recommendations
- Fuzzy Bisimulations in Fuzzy Description Logics Under the Gödel Semantics
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics
- Fuzzy logic algebras on residuated lattices
- scientific article; zbMATH DE number 1094319
- Representation theorems for some fuzzy logics based on residuated non-distributive lattices
- scientific article; zbMATH DE number 1004276
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Fuzzy attribute logic over complete residuated lattices
Cites work
- Algebraic laws for nondeterminism and concurrency
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics
- Bisimulations for fuzzy automata
- Bisimulations for fuzzy transition systems revisited
- Bisimulations for weighted automata over an additively idempotent semiring
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Expressivity in chain-based modal logics
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3494368 (Why is no real title available?)
- scientific article; zbMATH DE number 1028833 (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
- Logic-Based Roughification
- Logical characterizations of regular equivalence in weighted social networks
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Making fuzzy description logic more general
- Metamathematics of fuzzy logic
- Modal equivalence and bisimilarity in many-valued modal logics with many-valued accessibility relations
- Modal logic
- Notions of bisimulation for Heyting-valued modal languages
- Simulation for lattice-valued doubly labeled transition systems
Cited in
(18)- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics
- Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic
- Doubly labeled transition systems based on complete residuated lattices
- scientific article; zbMATH DE number 7559483 (Why is no real title available?)
- A van Benthem theorem for fuzzy modal logic
- Characterization and computation of approximate bisimulations for fuzzy automata
- Fuzzy simulations and bisimulations between fuzzy automata
- Computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a fuzzy graph-based structure under the Gödel semantics
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Approximate bisimulations for Kripke models of fuzzy multimodal logics over complete Heyting algebras
- Breadth-first fuzzy bisimulations for fuzzy automata
- Incremental model checking for fuzzy computation tree logic
- Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
- Minimizing fuzzy interpretations in fuzzy description logics by using crisp bisimulations
- Depth-bounded fuzzy simulations and bisimulations between fuzzy automata
- Paraconsistent transition structures: compositional principles and a modal logic
- Approximate Hennessy-Milner type theorems for fuzzy multimodal logics over Heyting algebras
This page was built for publication: Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6058014)
