Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
DOI10.1016/J.FSS.2017.02.008zbMATH Open1380.68302OpenAlexW2594800718MaRDI QIDQ1697986FDOQ1697986
Authors: Hengyang Wu, Yixiang Chen, Tian-Ming Bu, Yuxin Deng 
Publication date: 21 February 2018
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2017.02.008
Recommendations
- Bisimulations for fuzzy transition systems revisited
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- scientific article; zbMATH DE number 6612705
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- A fuzzy modal logic for fuzzy transition systems
Modal logic (including the logic of norms) (03B45) Fuzzy logic; logic of vagueness (03B52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Fuzzy sets as a basis for a theory of possibility
- Bisimulation for labelled Markov processes
- Title not available (Why is that?)
- Algebraic laws for nondeterminism and concurrency
- Bisimulation through probabilistic testing
- Coalgebras for fuzzy transition systems
- Bisimulations for fuzzy automata
- Title not available (Why is that?)
- Nondeterministic fuzzy automata
- Analysis and control of fuzzy discrete event systems using bisimulation equivalence
- Contrapositive symmetry of fuzzy implications
- Similarity relations and fuzzy orderings
- Computation of the greatest simulations and bisimulations between fuzzy automata
- A behavioural pseudometric for probabilistic transition systems
- Probabilistic logical characterization
- Bisimulations for non-deterministic labelled Markov processes
- Probabilistic extensions of process algebras.
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Bisimulations for weighted automata over an additively idempotent semiring
- Latticed simulation relations and games
- Model checking computation tree logic over finite lattices
- Logical characterizations of behavioral relations on transition systems of probability distributions
Cited In (11)
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- Weak bisimulations for fuzzy automata
- Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic
- Characterization and computation of approximate bisimulations for fuzzy automata
- Fuzzy simulations and bisimulations between fuzzy automata
- Bisimulations for fuzzy transition systems revisited
- Title not available (Why is that?)
- 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 fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
This page was built for publication: Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697986)
