Optimal state-space lumping in Markov chains
type: Item
instance of: scholarly article
title: Optimal state-space lumping in Markov chains
zbMATH Open document ID: 1189.68039
DOI: 10.1016/S0020-0190(03)00343-0
author: Salem Derisavi
author: Holger Hermanns
author: William H. Sanders
published in: Information Processing Letters
publication date: 2009-04-28T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5547817
zbMATH Keywords: bisimulation
zbMATH Keywords: computational complexity
zbMATH Keywords: lumpability
zbMATH Keywords: Markov chains
zbMATH Keywords: splay trees
describes a project that uses: Möbius
MaRDI profile type: Publication
cites work: On the computational power of pushdown automata
cites work: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
cites work: Exact and ordinary lumpability in finite Markov chains
cites work: Q4952904
cites work: Q4936893
cites work: Q4045961
cites work: Q5635253
cites work: Q4032309
cites work: Q3262596
cites work: Bisimulation through probabilistic testing
cites work: Q3992568
cites work: Three Partition Refinement Algorithms
cites work: Self-adjusting binary search trees
cites work: Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
full work available at URL: s0020-0190(03)00343-0
OpenAlex ID: W2044811734
Recommended article: A Symbolic Algorithm for Optimal Markov Chain Lumping
Recommended article: Bounding the lumping error in Markov chain dynamics
Recommended article: Q3795013
Recommended article: Lumpability for uncertain continuous-time Markov chains
Recommended article: A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
Recommended article: Lumping in Markov set-chains
Recommended article: Q4021339
Recommended article: Lumpability and marginalisability for continuous-time Markov chains
description: scientific article; zbMATH DE number 5547817