Converging from Branching to Linear Metrics on Markov Chains

DOI10.1007/978-3-319-25150-9_21zbMath1407.68277OpenAlexW2295202592MaRDI QIDQ2787435

Giovanni Bacci, Giorgio Bacci, Radu Mardare, Kim Guldstrand Larsen

Publication date: 25 February 2016

Published in: Theoretical Aspects of Computing - ICTAC 2015 (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/70230/

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

Complete axiomatization for the total variation distance of Markov chains ⋮ SOS specifications for uniformly continuous operators ⋮ Unnamed Item ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ On the metric-based approximate minimization of Markov chains ⋮ Compositional weak metrics for group key update

This page was built for publication: Converging from Branching to Linear Metrics on Markov Chains