Pages that link to "Item:Q596029"

The following pages link to Metrics for labelled Markov processes (Q596029):

Displaying 50 items.

• Expressiveness of probabilistic modal logics: a gradual approach (Q2417857) (← links)
• Comparing chemical reaction networks: a categorical and algorithmic perspective (Q2422009) (← links)
• Approximate bisimulation relations for constrained linear systems (Q2467487) (← links)
• Bisimulation and cocongruence for probabilistic systems (Q2495642) (← links)
• Approximating and computing behavioural distances in probabilistic transition systems (Q2503333) (← links)
• Differential logical relations. II: Increments and derivatives (Q2664934) (← links)
• Probabilistic NetKAT (Q2802486) (← links)
• Proving approximate implementations for probabilistic I/O automata (Q2864525) (← links)
• Approximating Labelled Markov Processes Again! (Q2888484) (← links)
• A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems (Q2937731) (← links)
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
• Some properties of stochastic labeling procedures (Q3315038) (← links)
• (Q3384913) (← links)
• Quantitative Simulation Games (Q3587251) (← links)
• (Q4553277) (← links)
• (Q4558787) (← links)
• Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
• (Q4580323) (← links)
• On Computing the Total Variation Distance of Hidden Markov Models. (Q5002817) (← links)
• Up-To Techniques for Behavioural Metrics via Fibrations (Q5009431) (← links)
• (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras (Q5009455) (← links)
• (Q5089293) (← links)
• Differential logical relations, Part I: The simply-typed case (Q5091273) (← links)
• (Q5094149) (← links)
• (Q5109515) (← links)
• Compositional weak metrics for group key update (Q5111289) (← links)
• Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement (Q5348126) (← links)
• Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations (Q5418954) (← links)
• Bisimulation for Markov Decision Processes through Families of Functional Expressions (Q5418971) (← links)
• Random Measurable Selections (Q5418972) (← links)
• TCC, with History (Q5418978) (← links)
• Simulation Hemi-metrics between Infinite-State Stochastic Games (Q5458350) (← links)
• Non Expansive ε-Bisimulations (Q5505435) (← links)
• (Q5856412) (← links)
• Asymmetric Distances for Approximate Differential Privacy (Q5875371) (← links)
• Three metric domains of processes for bisimulation (Q5890043) (← links)
• Approximating Markov Processes by Averaging (Q5895176) (← links)
• CONCUR 2003 - Concurrency Theory (Q5900586) (← links)
• Explainability of probabilistic bisimilarity distances for labelled Markov chains (Q6091199) (← links)
• Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach (Q6104820) (← links)
• Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)
• A framework to measure the robustness of programs in the unpredictable environment (Q6135769) (← links)
• Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
• Up-to techniques for behavioural metrics via fibrations (Q6190392) (← links)
• A monoidal view on fixpoint checks (Q6535504) (← links)
• Computing bisimilarity metrics for probabilistic timed automata (Q6536354) (← links)
• (Towards a) statistical probabilistic lazy lambda calculus (Q6612804) (← links)
• Structure in machine learning (Q6612806) (← links)
• Drawing from an urn is isometric (Q6629453) (← links)
• Sum and tensor of quantitative effects (Q6635519) (← links)