On the metric-based approximate minimization of Markov chains

DOI10.4230/LIPICS.ICALP.2017.104zbMATH Open1442.68079MaRDI QIDQ5111436FDOQ5111436

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

Publication date: 27 May 2020

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 \(\epsilon\)-approximations of Markov chains
• Approximating Markov processes by averaging

zbMATH Keywords

probabilistic modelsautomata minimizationbehavioral distances

Mathematics Subject Classification ID

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

Cited In (5)

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

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)