Exploiting partial symmetries for Markov chain aggregation

MaRDI QIDQ2703728zbMATH OpenFDO

Authors L. Capra, C. Dutheillet, G. Franceschinis, J.-M. Ilié

Publication date 8 May 2001

zbMATH Keywords

algorithmcontinuous time Markov chainextended symbolic reachability graphlumped Markov chainstochastic well-formed net models

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40)

Recommendations

• scientific article; zbMATH DE number 830005
• scientific article; zbMATH DE number 4209242
• scientific article; zbMATH DE number 1694907
• Aggregation of Markov chains
• scientific article; zbMATH DE number 4044894
• scientific article; zbMATH DE number 19229
• Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
• Symmetrizations for Markov processes

Cited in

(2)

• Approximate lumpability for Markovian agent-based models using local symmetries
• A Symbolic Algorithm for Optimal Markov Chain Lumping

Describes a project that uses

Uses Software

• GreatSPN
• GreatSPN 1.7

This page was built for publication: Exploiting partial symmetries for Markov chain aggregation

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