Pages that link to "Item:Q2503333"
From MaRDI portal
The following pages link to Approximating and computing behavioural distances in probabilistic transition systems (Q2503333):
Displaying 22 items.
- Approximating bisimilarity for Markov processes (Q265837) (← links)
- A pseudometric in supervisory control of probabilistic discrete event systems (Q351739) (← links)
- Approximating Markov processes through filtration (Q442296) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Simulation distances (Q764284) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- Polynomial-time algorithms for computing distances of fuzzy transition systems (Q1749476) (← links)
- A behavioural pseudometric for probabilistic transition systems (Q1770428) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Complete axiomatization for the total variation distance of Markov chains (Q2130580) (← links)
- Unwinding biological systems (Q2348024) (← links)
- Comparing chemical reaction networks: a categorical and algorithmic perspective (Q2422009) (← links)
- Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
- Quantitative Simulation Games (Q3587251) (← links)
- (Q4558787) (← links)
- (Q4965819) (← links)
- (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras (Q5009455) (← links)
- Quantitative Behavioural Reasoning for Higher-order Effectful Programs (Q5145320) (← links)
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems (Q5758050) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900586) (← links)
- Computing bisimilarity metrics for probabilistic timed automata (Q6536354) (← links)
