Pages that link to "Item:Q2892788"
From MaRDI portal
The following pages link to On the Complexity of Computing Probabilistic Bisimilarity (Q2892788):
Displaying 23 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)
- BPA bisimilarity is EXPTIME-hard (Q1943623) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context (Q2988377) (← links)
- On Bisimilarity and Substitution in Presence of Replication (Q3587460) (← links)
- (Q4558784) (← links)
- (Q4558787) (← links)
- Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
- On Computing the Total Variation Distance of Hidden Markov Models. (Q5002817) (← links)
- (Q5009421) (← links)
- (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras (Q5009455) (← links)
- (Q5111641) (← 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)
- (Q5856412) (← links)
- Asymmetric Distances for Approximate Differential Privacy (Q5875371) (← links)
- Explainability of probabilistic bisimilarity distances for labelled Markov chains (Q6091199) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)
- A monoidal view on fixpoint checks (Q6535504) (← links)
- Computing bisimilarity metrics for probabilistic timed automata (Q6536354) (← links)
