Linear Distances between Markov Chains
From MaRDI portal
Publication:4608672
DOI10.4230/LIPIcs.CONCUR.2016.20zbMath1392.68293arXiv1605.00186OpenAlexW2345655206MaRDI QIDQ4608672
Jan Křetínský, Tatjana Petrov, Przemysław Daca, Thomas A. Henzinger
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1605.00186
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (9)
SOS specifications for uniformly continuous operators ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ Approximate constrained lumping of polynomial differential equations ⋮ Unnamed Item ⋮ On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ A probabilistic calculus of cyber-physical systems ⋮ Compositional weak metrics for group key update
This page was built for publication: Linear Distances between Markov Chains
