Pages that link to "Item:Q3167014"
From MaRDI portal
The following pages link to Computing Game Metrics on Markov Decision Processes (Q3167014):
Displaying 14 items.
- Polynomial-time algorithms for computing distances of fuzzy transition systems (Q1749476) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Fixpoint theory -- upside down (Q2233395) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Algorithms for game metrics (Q2786130) (← links)
- Algorithms for Game Metrics (Q3165951) (← links)
- Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
- (Q5009421) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- Simulation Hemi-metrics between Infinite-State Stochastic Games (Q5458350) (← links)
- (Q5856412) (← links)
- (Q5875370) (← links)
- Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)
- Fixpoint Theory -- Upside Down (Q6135764) (← links)