Pages that link to "Item:Q2892788"
From MaRDI portal
The following pages link to On the Complexity of Computing Probabilistic Bisimilarity (Q2892788):
Displayed 9 items.
- Addendum to ``Recursively defined metric spaces without contraction'' (Q391132) (← links)
- Polynomial-time algorithms for computing distances of fuzzy transition systems (Q1749476) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context (Q2988377) (← links)
- (Q4558784) (← links)
- (Q4558787) (← links)
- Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- Bisimulation for Markov Decision Processes through Families of Functional Expressions (Q5418971) (← links)