On the metric-based approximate minimization of Markov chains

DOI10.4230/LIPICS.ICALP.2017.104MaRDI QIDQ5111436zbMATH OpenFDO

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

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2017.104

zbMATH Keywords

automata minimizationbehavioral distancesprobabilistic models

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• On the metric-based approximate minimization of Markov chains
• Converging from branching to linear metrics on Markov chains
• Converging from Branching to Linear Metrics on Markov Chains
• Blackwell spaces and -approximations of Markov chains
• Approximating Markov processes by averaging

Cited in

(5)

• Abstract model repair for probabilistic systems
• On the metric-based approximate minimization of Markov chains
• Converging from branching to linear metrics on Markov chains
• Computing probabilistic bisimilarity distances for probabilistic automata
• An MM algorithm to estimate parameters in continuous-time Markov chains

This page was built for publication: On the metric-based approximate minimization of Markov chains

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