Lattice-valued simulations for quantitative transition systems
From MaRDI portal
Publication:473367
DOI10.1016/j.ijar.2014.10.001zbMath1388.68201OpenAlexW1979707769WikidataQ62038113 ScholiaQ62038113MaRDI QIDQ473367
Yongzhi Cao, Haiyu Pan, Yong-Ming 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
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (11)
Similarity-based minimization of fuzzy tree automata ⋮ Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices ⋮ Fuzzy simulations and bisimulations between fuzzy automata ⋮ Limited approximate bisimulations and the corresponding rough approximations ⋮ Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic ⋮ The approximate correctness of systems based on \(\delta\)-bisimulation ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ Polynomial-time algorithms for computing distances of fuzzy transition systems ⋮ Unnamed Item ⋮ Approximate bisimulation relations for fuzzy automata ⋮ A family of graded epistemic logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulations for fuzzy automata
- Formalization of implication based fuzzy reasoning method
- Metrics for labelled Markov processes
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Quantitative analysis of weighted transition systems
- Simulation distances
- Congruences and homomorphisms of fuzzy automata
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- The completeness and applications of the formal system \(\mathcal L^\ast\)
- Automata theory based on complete residuated lattice-valued logic. II
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity
- A note on Trillas' CHC models
- Bisimulation through probabilistic testing
- Deciding bisimilarity is P-complete
- Metamathematics of fuzzy logic
- Bisimulation indexes and their applications
- A behavioural pseudometric for probabilistic transition systems
- Forward and backward simulations. I. Untimed Systems
- Robustness analysis of full implication inference method
- Hierarchical structure and applications of fuzzy logical systems
- On robustness of the full implication triple I inference method with respect to finer measurements
- Simulation for lattice-valued doubly labeled transition systems
- Continuity of triple I methods based on several implications
- A lattice-theoretical fixpoint theorem and its applications
- On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice
- Introduction to Bisimulation and Coinduction
- Algebraic laws for nondeterminism and concurrency
- Reliability of Mobile Processes with Noisy Channels
- Approximation Metrics for Discrete and Continuous Systems
- Reactive Systems
- A Behavioural Pseudometric based on λ–Bisimilarity
This page was built for publication: Lattice-valued simulations for quantitative transition systems
