Computation of the greatest simulations and bisimulations between fuzzy automata
From MaRDI portal
Publication:690916
DOI10.1016/j.fss.2012.05.006zbMath1252.68168arXiv1103.5078OpenAlexW1645024112MaRDI QIDQ690916
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)
Full work available at URL: https://arxiv.org/abs/1103.5078
simulationfuzzy relationbisimulationfuzzy automatoncomplete residuated latticefuzzy relation inequalitypost-fixed point
Related Items
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES, Weak bisimulations for fuzzy automata, Weakly linear systems for matrices over the max-plus quantale, 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, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Weighted Automata over Vector Spaces, A logical framework for privacy-preserving social network publication, A fuzzy modal logic for fuzzy transition systems, Bisimulations for weighted automata over an additively idempotent semiring, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, Lattice-valued simulations for quantitative transition systems, Rough approximations based on bisimulations, Logical characterizations of simulation and bisimulation for fuzzy transition systems, Further improvements of determinization methods for fuzzy finite automata, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Labeled fuzzy approximations based on bisimulations, Polynomial-time algorithms for computing distances of fuzzy transition systems, Model checking fuzzy computation tree logic, Construction of fuzzy automata from fuzzy regular expressions, Weakly linear systems of fuzzy relation inequalities: the heterogeneous case, Logical characterizations of regular equivalence in weighted social networks, Quantitative simulations by matrices, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, Approximate bisimulation relations for fuzzy automata, Bisimulation of type 2 for BL-general fuzzy automata, Direct and Indirect Methods for Solving Two-Mode Systems of Fuzzy Relation Equations and Inequalities, (f, g)-derivation of ordered Γ-semirings, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application, Regular fuzzy equivalences on two - mode fuzzy Networksi, Simulation for lattice-valued doubly labeled transition systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulations for fuzzy automata
- An improved algorithm for determinization of weighted and fuzzy automata
- 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
- Weighted finite automata over strong bimonoids
- 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
- 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
- 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
- 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
- Fuzzy sets and systems. Theory and applications
- A calculus of communicating systems
- Fuzzy automata and languages
- Resolution of eigen fuzzy sets equations
- What's decidable about hybrid automata?
- Metamathematics of fuzzy logic
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- From bisimulation to simulation: Coarsest partition problems
- Towards a unified view of bisimulation: A comparative study
- Construction of fuzzy automata from fuzzy regular expressions
- Determinism and fuzzy automata
- An efficient algorithm for computing bisimulation equivalence
- Forward and backward simulations. I. Untimed Systems
- Formal power series and regular operations on fuzzy languages
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Diagnosability of fuzzy discrete event systems
- Bisimulation relations for weighted automata
- Max-product machines
- Introduction to Discrete Event Systems
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- On the generating sequences of regular languages on k symbols
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Three Partition Refinement Algorithms
- Resolution of composite fuzzy relation equations
- FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
- A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
- Reactive Systems
- Factorization of Fuzzy Automata
- An Incremental Bisimulation Algorithm
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Automata, Languages and Programming
- Fuzzy equational logic
