Logical characterizations of simulation and bisimulation for fuzzy transition systems
From MaRDI portal
Publication:679804
DOI10.1016/j.fss.2015.09.012zbMath1378.68121OpenAlexW2186273310MaRDI QIDQ679804
Publication date: 22 January 2018
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2015.09.012
Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (18)
Fuzzy approximations of fuzzy relational structures ⋮ Bisimulations for fuzzy transition systems revisited ⋮ Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices ⋮ Characterization and computation of approximate bisimulations for fuzzy automata ⋮ Fuzzy simulations and bisimulations between fuzzy automata ⋮ Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems ⋮ Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ A fuzzy modal logic for fuzzy transition systems ⋮ Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures ⋮ Limited approximate bisimulations and the corresponding rough approximations ⋮ Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences ⋮ Approximate bisimulation relations for fuzzy automata ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ A family of graded epistemic logics ⋮ Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Bisimulations for fuzzy automata
- Probabilistic logical characterization
- Finite automata theory with membership values in lattices
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Bisimulation minimization and symbolic model checking
- Nondeterministic fuzzy automata
- Analysis and control of fuzzy discrete event systems using bisimulation equivalence
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Determinization of weighted finite automata over strong bimonoids
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- Fuzzy sets as a basis for a theory of possibility
- Approximating labelled Markov processes
- Characterizations of fuzzy finite automata.
- Determinism and fuzzy automata
- Pattern recognition using temporal fuzzy automata
- Simulation for lattice-valued doubly labeled transition systems
- Bisimulations for weighted automata over an additively idempotent semiring
- Tree regular model checking: a simulation-based approach
- Bisimulation for labelled Markov processes
- LATTICED SIMULATION RELATIONS AND GAMES
- Algebraic laws for nondeterminism and concurrency
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
This page was built for publication: Logical characterizations of simulation and bisimulation for fuzzy transition systems
