A component-based solution for reducible Markov regenerative processes
Performance Evaluation
Backward Solution of Markov Chains and Markov Regenerative Processes: Formalization and Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This demo presents MC4 CSLTA, an efficient Markov chain Model Checker for (four) the stochastic logic CSLTA. In CSLTA formulas are either steady state queries or path formulas, where accepting paths are specified through a Deterministic Timed Automata (DTA). MC4CSLTA takes as input a labeled CTMC, a query, one or more DTA involved in the query (possibly expressed in parametric form), and computes the needed probability to assess the truth value of the formula. MC4CSLTA is written in C++, and is publicly available for the research community.