Pages that link to "Item:Q5418964"
From MaRDI portal
The following pages link to The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964):
Displaying 11 items.
- On the computational complexity of approximating distributions by probabilistic automata (Q1207305) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Expressiveness of probabilistic modal logics: a gradual approach (Q2417857) (← links)
- On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790) (← links)
- (Q5009421) (← links)
- (Q5111641) (← links)
- (Q5856412) (← links)
- (Q5875370) (← links)
- Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)
- Computing bisimilarity metrics for probabilistic timed automata (Q6536354) (← links)