Pages that link to "Item:Q5326310"
From MaRDI portal
The following pages link to On-the-Fly Exact Computation of Bisimilarity Distances (Q5326310):
Displaying 12 items.
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Unwinding biological systems (Q2348024) (← links)
- Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
- (Q5009421) (← links)
- (Q5111641) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- (Q5856412) (← links)
- Asymmetric Distances for Approximate Differential Privacy (Q5875371) (← links)
- A taxonomy for similarity metrics between Markov decision processes (Q6097106) (← links)
- Computing bisimilarity metrics for probabilistic timed automata (Q6536354) (← links)