Converging from branching to linear metrics on Markov chains

DOI10.1017/S0960129517000160MaRDI QIDQ4559599zbMATH OpenOpenAlexFDO

Authors Giorgio Bacci, Giovanni Bacci, Radu Mardare, Kim G. Larsen

Publication date 4 December 2018

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129517000160

Mathematics Subject Classification ID

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

Recommendations

• Converging from Branching to Linear Metrics on Markov Chains
• Linear distances between Markov chains
• Automata, Languages and Programming
• On the metric-based approximate minimization of Markov chains
• On the metric-based approximate minimization of Markov chains

Cites work

• A simple coupling of renewal processes
• Automata, Languages and Programming
• Bisimulation for Markov decision processes through families of functional expressions
• Bisimulation through probabilistic testing
• Computing Game Metrics on Markov Decision Processes
• Deciding bisimilarity and similarity for probabilistic processes.
• scientific article; zbMATH DE number 177825 (Why is no real title available?)
• scientific article; zbMATH DE number 1361128 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Metrics for labelled Markov processes
• On the complexity of computing probabilistic bisimilarity
• On the total variation distance of labelled Markov chains
• On the total variation distance of semi-Markov chains
• On-the-fly exact computation of bisimilarity distances
• The consensus string problem and the complexity of comparing hidden Markov models.
• Three Partition Refinement Algorithms
• Upper-expectation bisimilarity and Łukasiewicz -calculus

Cited in

(9)

• On the metric-based approximate minimization of Markov chains
• Converging from Branching to Linear Metrics on Markov Chains
• On approximation metrics for linear temporal model-checking of stochastic systems
• Linear distances between Markov chains
• On the metric-based approximate minimization of Markov chains
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computing bisimilarity metrics for probabilistic timed automata
• A complete quantitative axiomatisation of behavioural distance of regular expressions
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces

This page was built for publication: Converging from branching to linear metrics on Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559599)