The following pages link to (Q4535035):
Displayed 39 items.
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- A metrized duality theorem for Markov processes (Q283765) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity (Q1004387) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- A behavioural pseudometric for probabilistic transition systems (Q1770428) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Bisimulation metrics and norms for real-weighted automata (Q2064519) (← links)
- Complete axiomatization for the total variation distance of Markov chains (Q2130580) (← links)
- A unified framework for differential aggregations in Markovian process algebra (Q2258842) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Bisimulation and cocongruence for probabilistic systems (Q2495642) (← links)
- Approximating and computing behavioural distances in probabilistic transition systems (Q2503333) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Proving Approximate Implementations for Probabilistic I/O Automata (Q2864525) (← links)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- (Q4558787) (← links)
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice (Q4923369) (← links)
- (Q5009421) (← links)
- Up-To Techniques for Behavioural Metrics via Fibrations (Q5009431) (← links)
- Monads and Quantitative Equational Theories for Nondeterminism and Probability (Q5089294) (← links)
- Differential logical relations, Part I: The simply-typed case (Q5091273) (← links)
- (Q5109515) (← links)
- Model Checking Quantitative Linear Time Logic (Q5415664) (← links)
- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations (Q5418954) (← 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)
- Simulation Hemi-metrics between Infinite-State Stochastic Games (Q5458350) (← links)
- Non Expansive ε-Bisimulations (Q5505435) (← links)
- Approximating Markov Processes by Averaging (Q5895176) (← links)
- Explainability of probabilistic bisimilarity distances for labelled Markov chains (Q6091199) (← links)
- Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis (Q6104803) (← links)
- Up-to techniques for behavioural metrics via fibrations (Q6190392) (← links)