Computation of the greatest simulations and bisimulations between fuzzy automata
From MaRDI portal
Publication:690916
Abstract: Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, and backward-forward bisimulations) between fuzzy automata have been introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of this kind. In the present paper, for any of the above-mentioned types of simulations/bisimulations we provide an effective algorithm for deciding whether there is a simulation/bisimulation of this type between the given fuzzy automata, and for computing the greatest one, whenever it exists. The algorithms are based on the method developed in [J. Ignjatovi'c, M. 'Ciri'c, S. Bogdanovi'c, On the greatest solutions to certain systems of fuzzy relation inequalities and equations, Fuzzy Sets and Systems 161 (2010) 3081-3113], which comes down to the computing of the greatest post-fixed point, contained in a given fuzzy relation, of an isotone function on the lattice of fuzzy relations.
Recommendations
Cites work
- scientific article; zbMATH DE number 5367214 (Why is no real title available?)
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3589732 (Why is no real title available?)
- scientific article; zbMATH DE number 3623470 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1472777 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 764336 (Why is no real title available?)
- scientific article; zbMATH DE number 6174576 (Why is no real title available?)
- scientific article; zbMATH DE number 233974 (Why is no real title available?)
- scientific article; zbMATH DE number 2199279 (Why is no real title available?)
- scientific article; zbMATH DE number 2225808 (Why is no real title available?)
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
- A calculus of communicating systems
- An Incremental Bisimulation Algorithm
- An efficient algorithm for computing bisimulation equivalence
- An improved algorithm for determinization of weighted and fuzzy automata
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Automata, Languages and Programming
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Backward and forward bisimulation minimization of tree automata
- Bisimulation relations for weighted automata
- Bisimulations for fuzzy automata
- CCS expressions, finite state processes, and three problems of equivalence
- Characterizations of fuzzy finite automata.
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Congruences and homomorphisms of fuzzy automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Construction of fuzzy automata from fuzzy regular expressions
- Determinism and fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Determinization of weighted finite automata over strong bimonoids
- Diagnosability of fuzzy discrete event systems
- Equivalence in automata theory based on complete residuated lattice-valued logic
- FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
- Factorization of Fuzzy Automata
- Finite \(L\)-fuzzy machines.
- Formal power series and regular operations on fuzzy languages
- Forward and backward simulations. I. Untimed Systems
- From bisimulation to simulation: Coarsest partition problems
- Fuzzy automata and languages
- Fuzzy equational logic
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Fuzzy homomorphisms of algebras
- Fuzzy relation equations and reduction of fuzzy automata
- Fuzzy sets and systems. Theory and applications
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Introduction to Discrete Event Systems
- Max-product machines
- Maximin automata
- Metamathematics of fuzzy logic
- Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
- Myhill-Nerode type theory for fuzzy languages and automata
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- On the generating sequences of regular languages on \(k\) symbols
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Reactive Systems
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Resolution of composite fuzzy relation equations
- Resolution of eigen fuzzy sets equations
- The algorithm design manual
- The relationship of controllability between classical and fuzzy discrete-event systems
- Three Partition Refinement Algorithms
- Towards a unified view of bisimulation: A comparative study
- Weighted finite automata over strong bimonoids
- What's decidable about hybrid automata?
- Words and bisimulations of dynamical systems
Cited in
(44)- \((f,g)\)-derivation of ordered \(\Gamma\)-semirings
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- Bisimulations for fuzzy transition systems revisited
- Bisimulations for weighted automata over an additively idempotent semiring
- Direct and indirect methods for solving two-mode systems of fuzzy relation equations and inequalities
- Simulation for lattice-valued doubly labeled transition systems
- Weak bisimulations for fuzzy automata
- Computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a fuzzy graph-based structure under the Gödel semantics
- Bisimulations for fuzzy automata
- Approximate bisimulation relations for fuzzy automata
- Simulations and bisimulations for max-plus automata
- Weighted Automata over Vector Spaces
- Labeled fuzzy approximations based on bisimulations
- Logical characterizations of regular equivalence in weighted social networks
- TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
- Further improvements of determinization methods for fuzzy finite automata
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- scientific article; zbMATH DE number 3559796 (Why is no real title available?)
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Bisimulation of type 2 for BL-general fuzzy automata
- A logical framework for privacy-preserving social network publication
- Regular fuzzy equivalences on two-mode fuzzy networks
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- Quantitative simulations by matrices
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Fuzzy approximations of fuzzy relational structures
- Characterization and computation of approximate bisimulations for fuzzy automata
- Weakly linear systems for matrices over the max-plus quantale
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- scientific article; zbMATH DE number 6612705 (Why is no real title available?)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- A fuzzy modal logic for fuzzy transition systems
- Rough approximations based on bisimulations
- Model checking fuzzy computation tree logic
- Computing crisp bisimulations for fuzzy structures
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Bisimulation for BL-general fuzzy automata
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Fuzzy simulations and bisimulations between fuzzy automata
- Lattice-valued simulations for quantitative transition systems
- Construction of fuzzy automata from fuzzy regular expressions
- Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
This page was built for publication: Computation of the greatest simulations and bisimulations between fuzzy automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690916)
