Lattice-valued simulations for quantitative transition systems
DOI10.1016/J.IJAR.2014.10.001zbMATH Open1388.68201OpenAlexW1979707769WikidataQ62038113 ScholiaQ62038113MaRDI QIDQ473367FDOQ473367
Authors: Haiyu Pan, Yongzhi Cao, Yongming Li 
Publication date: 24 November 2014
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2014.10.001
Recommendations
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Deciding bisimilarity is P-complete
- Metamathematics of fuzzy logic
- Forward and backward simulations. I. Untimed Systems
- A lattice-theoretical fixpoint theorem and its applications
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulation distances
- Bisimulation through probabilistic testing
- Bisimulations for fuzzy automata
- Approximation Metrics for Discrete and Continuous Systems
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- A note on Trillas' CHC models
- On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice
- Reactive Systems
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Congruences and homomorphisms of fuzzy automata
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Automata theory based on complete residuated lattice-valued logic. II
- Introduction to bisimulation and coinduction
- Bisimulation indexes and their applications
- A behavioural pseudometric for probabilistic transition systems
- Reliability of Mobile Processes with Noisy Channels
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Quantitative analysis of weighted transition systems
- Continuity of triple I methods based on several implications
- Formalization of implication based fuzzy reasoning method
- The completeness and applications of the formal system \(\mathcal L^\ast\)
- Robustness analysis of full implication inference method
- Hierarchical structure and applications of fuzzy logical systems
- Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity
- On robustness of the full implication triple I inference method with respect to finer measurements
- Simulation for lattice-valued doubly labeled transition systems
- A behavioural pseudometric based on \(\lambda\)-bisimilarity
Cited In (15)
- Title not available (Why is that?)
- Simulation for lattice-valued doubly labeled transition systems
- Doubly labeled transition systems based on complete residuated lattices
- Simulations for quantitative alternating transition systems
- The approximate correctness of systems based on \(\delta\)-bisimulation
- Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic
- Limited approximate bisimulations and the corresponding rough approximations
- Generalized possibility computation tree logic with frequency and its model checking
- Fuzzy simulations and bisimulations between fuzzy automata
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- A family of graded epistemic logics
- Approximate bisimulation relations for fuzzy automata
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Similarity-based minimization of fuzzy tree automata
This page was built for publication: Lattice-valued simulations for quantitative transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473367)
