YMCA

Mario Bravetti, Holger Hermanns, Joost-Pieter Katoen
2006 Electronical Notes in Theoretical Computer Science  
Markov chains are widely used to determine system performance and reliability characteristics. The vast majority of applications considers continuous-time Markov chains (CTMCs). This note motivates how concurrency theory can be extended (as opposed to twisted) to CTMCs. We provide the core motivation for the algebraic setup of Interactive Markov Chains. Therefore, this note should have better been baptized YIMC. Continuous-time Markov chains (CTMCs) are a widely used performance evaluation
more » ... . They can be considered as labeled transition systems, where the transition labels-rates of negative exponential distributions-indicate the speed of the system evolving from one state to another. Numerical algorithms allow the computation of important characteristics of a given CTMC with relative ease and comfortable run times, and in a quantifiably precise manner. Using probabilistic model checking techniques also logical properties can be
doi:10.1016/j.entcs.2005.12.108 fatcat:rkd3kxi3i5bvrlw2obndku4264