Metrics for labelled Markov processes

DOI10.1016/j.tcs.2003.09.013zbMath1068.68093OpenAlexW2015172530MaRDI QIDQ596029

Radha Jagadeesan, Josée Desharnais, Vineet Gupta, Prakash Panangaden

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.09.013

zbMATH Keywords

Metric Labelled Markov processes Process Algebra

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (93)

Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey ⋮ Approximating Labelled Markov Processes Again! ⋮ A metrized duality theorem for Markov processes ⋮ A UTP approach for rTiMo ⋮ Complete axiomatization for the total variation distance of Markov chains ⋮ A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Bisimulation for Feller-Dynkin processes ⋮ Hennessy-Milner results for probabilistic PDL ⋮ Borel kernels and their approximation, categorically ⋮ Recursively defined metric spaces without contraction ⋮ Interleaving isotactics -- an equivalence notion on behaviour abstractions ⋮ Converging from branching to linear metrics on Markov chains ⋮ A pseudometric in supervisory control of probabilistic discrete event systems ⋮ Similarity quantification for linear stochastic systems: a coupling compensator approach ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Parametric probabilistic transition systems for system design and analysis ⋮ The category-theoretic solution of recursive metric-space equations ⋮ Differential logical relations. II: Increments and derivatives ⋮ Weak bisimulation for probabilistic timed automata ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ SOS specifications for uniformly continuous operators ⋮ Characterization and computation of infinite-horizon specifications over Markov processes ⋮ Unnamed Item ⋮ Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement ⋮ Expressiveness of probabilistic modal logics: a gradual approach ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Explainability of probabilistic bisimilarity distances for labelled Markov chains ⋮ A Hemimetric Extension of Simulation for Semi-Markov Decision Processes ⋮ Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach ⋮ Convex lattice equation systems ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ A framework to measure the robustness of programs in the unpredictable environment ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Denotational semantics and its algebraic derivation for an event-driven system-level language ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ Value-passing CCS with noisy channels ⋮ Approximating Markov processes through filtration ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ Computing branching distances with quantitative games ⋮ Unnamed Item ⋮ Lattice-valued simulations for quantitative transition systems ⋮ Interface simulation distances ⋮ A modal characterization of alternating approximate bisimilarity ⋮ On Computing the Total Variation Distance of Hidden Markov Models. ⋮ Asymmetric Distances for Approximate Differential Privacy ⋮ Approximate simulation relations for hybrid systems ⋮ A quantified coalgebraic van Benthem theorem ⋮ Up-To Techniques for Behavioural Metrics via Fibrations ⋮ (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras ⋮ Limited approximate bisimulations and the corresponding rough approximations ⋮ Approximate bisimulation relations for constrained linear systems ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Polynomial-time algorithms for computing distances of fuzzy transition systems ⋮ Weighted modal transition systems ⋮ Differential privacy in probabilistic systems ⋮ Approximate bisimulation: a bridge between computer science and control theory ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ Bisimulation for Markov Decision Processes through Families of Functional Expressions ⋮ Random Measurable Selections ⋮ TCC, with History ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ On metrics for probabilistic systems: definitions and algorithms ⋮ Metrics for weighted transition systems: axiomatization and complexity ⋮ Quantitative Simulation Games ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Domain theory, testing and simulation for labelled Markov processes ⋮ Unnamed Item ⋮ Bisimulation and cocongruence for probabilistic systems ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximating and computing behavioural distances in probabilistic transition systems ⋮ Unnamed Item ⋮ On the metric-based approximate minimization of Markov chains ⋮ Probabilistic NetKAT ⋮ Compositionality for quantitative specifications ⋮ Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity ⋮ Simulation Hemi-metrics between Infinite-State Stochastic Games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A probabilistic calculus of cyber-physical systems ⋮ Approximating Markov Processes by Averaging ⋮ Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations ⋮ Differential logical relations, Part I: The simply-typed case ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ Dynamics of reputation in mobile agents systems and weighted timed automata ⋮ Simulation distances ⋮ Approximating Markovian testing equivalence ⋮ Compositional weak metrics for group key update ⋮ Non Expansive ε-Bisimulations ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey ⋮ Proving Approximate Implementations for Probabilistic I/O Automata ⋮ How adaptive and reliable is your program?

Cites Work

This page was built for publication: Metrics for labelled Markov processes