Optimal state-space lumping in Markov chains (Q1014448): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and ordinary lumpability in finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains / rank
 
Normal rank

Latest revision as of 12:59, 1 July 2024

scientific article
Language Label Description Also known as
English
Optimal state-space lumping in Markov chains
scientific article

    Statements

    Optimal state-space lumping in Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2009
    0 references
    0 references
    bisimulation
    0 references
    computational complexity
    0 references
    lumpability
    0 references
    Markov chains
    0 references
    splay trees
    0 references