Polynomial-time algorithms for computing distances of fuzzy transition systems
From MaRDI portal
Publication:1749476
DOI10.1016/j.tcs.2018.03.002zbMath1390.68464arXiv1701.06644MaRDI QIDQ1749476
Yongzhi Cao, Tingting Han, Taolue Chen
Publication date: 17 May 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.06644
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- Weak bisimulations for fuzzy automata
- Bisimulations for fuzzy automata
- Lattice-valued simulations for quantitative transition systems
- Metrics for labelled Markov processes
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Nondeterministic fuzzy automata
- On metrics for probabilistic systems: definitions and algorithms
- Geometric algorithms and combinatorial optimization.
- A behavioural pseudometric for probabilistic transition systems
- Bisimulation relations for weighted automata
- A lattice-theoretical fixpoint theorem and its applications
- On the Complexity of Computing Probabilistic Bisimilarity
- Computing Game Metrics on Markov Decision Processes
- Bisimulation Metrics for Continuous Markov Decision Processes
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
