Computation of the greatest simulations and bisimulations between fuzzy automata
From MaRDI portal
Publication:690916
DOI10.1016/J.FSS.2012.05.006zbMATH Open1252.68168arXiv1103.5078OpenAlexW1645024112MaRDI QIDQ690916FDOQ690916
Jelena Ignjatović, Ivana Jančić, Nada Damljanović, Miroslav Ćirić
Publication date: 29 November 2012
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1103.5078
Recommendations
simulationbisimulationfuzzy automatonfuzzy relationcomplete residuated latticefuzzy relation inequalitypost-fixed point
Cites Work
- The algorithm design manual
- Fuzzy sets and systems. Theory and applications
- Title not available (Why is that?)
- What's decidable about hybrid automata?
- Metamathematics of fuzzy logic
- Forward and backward simulations. I. Untimed Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
- Introduction to Discrete Event Systems
- Three Partition Refinement Algorithms
- Title not available (Why is that?)
- Bisimulations for fuzzy automata
- Title not available (Why is that?)
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Fuzzy homomorphisms of algebras
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- A calculus of communicating systems
- Fuzzy automata and languages
- Resolution of eigen fuzzy sets equations
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- Construction of fuzzy automata from fuzzy regular expressions
- Determinism and fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Bisimulation relations for weighted automata
- Max-product machines
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Resolution of composite fuzzy relation equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reactive Systems
- An improved algorithm for determinization of weighted and fuzzy automata
- Factorization of Fuzzy Automata
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Title not available (Why is that?)
- Fuzzy equational logic
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Congruences and homomorphisms of fuzzy automata
- Backward and forward bisimulation minimization of tree automata
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- CCS expressions, finite state processes, and three problems of equivalence
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- Determinization of weighted finite automata over strong bimonoids
- Towards a unified view of bisimulation: A comparative study
- Title not available (Why is that?)
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
- Automata, Languages and Programming
- From bisimulation to simulation: Coarsest partition problems
- An efficient algorithm for computing bisimulation equivalence
- Diagnosability of fuzzy discrete event systems
- On the generating sequences of regular languages on k symbols
- FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
- Words and bisimulations of dynamical systems
- Weighted finite automata over strong bimonoids
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- The relationship of controllability between classical and fuzzy discrete-event systems
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Title not available (Why is that?)
- An Incremental Bisimulation Algorithm
Cited In (41)
- Simulation for lattice-valued doubly labeled transition systems
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- Weak bisimulations for fuzzy automata
- Simulations and bisimulations for max-plus automata
- (f, g)-derivation of ordered Γ-semirings
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- Labeled fuzzy approximations based on bisimulations
- Weakly linear systems for matrices over the max-plus quantale
- Characterization and computation of approximate bisimulations for fuzzy automata
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Fuzzy simulations and bisimulations between fuzzy automata
- Quantitative simulations by matrices
- Fuzzy approximations of fuzzy relational structures
- Bisimulations for weighted automata over an additively idempotent semiring
- A logical framework for privacy-preserving social network publication
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Bisimulation of type 2 for BL-general fuzzy automata
- Bisimulations for fuzzy transition systems revisited
- 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
- Construction of fuzzy automata from fuzzy regular expressions
- Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
- Approximate bisimulation relations for fuzzy automata
- Regular fuzzy equivalences on two - mode fuzzy Networksi
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Title not available (Why is that?)
- Lattice-valued simulations for quantitative transition systems
- Weighted Automata over Vector Spaces
- 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
- TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Rough approximations based on bisimulations
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Logical characterizations of regular equivalence in weighted social networks
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Direct and Indirect Methods for Solving Two-Mode Systems of Fuzzy Relation Equations and Inequalities
- Further improvements of determinization methods for fuzzy finite automata
- Model checking fuzzy computation tree logic
Uses Software
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)
