A Markov reward model checker

QEST 2005 - Proceedings Second International Conference on the Quantitative Evaluation of SysTems

Volumn 2005, Issue , 2005, Pages 243-244

  Katoen, Joost Pieter ^a,b   Khattri, Maneesh ^a   Zapreev, Ivan S ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DISCRETE TIME CONTROL SYSTEMS; MATHEMATICAL MODELS; NUMERICAL METHODS;

AUTOMATED VERIFICATION; CUMULATIVE REWARDS; MARKOV REWARD MODEL CHECKER (MRMC); NUMERICAL ALGORITHMS;

MARKOV PROCESSES;

EID: 33750308810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2005.2     Document Type: Conference Paper

References (8)

1. S. Andova, H. Hermanns, and J.-P. Katoen. Discrete-time rewards model-checked. In Formal Modeling and Analysis of Timed Systems (FORMATS 2003), Marseille, France, 2003. Lecture Notes in Computer Science, Springer-Verlag.
2. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov Chains. IEEE Transactions on Software Engineering, 29(7), 2003.
3. C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. On the Logical Characterisation of Performability Properties. In ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 780-792, London, UK, 2000. Springer-Verlag.
4. L. Cloth, J.-P. Katoen, M. Khattri, and R. Pulungan. Model-checking Markov reward models with impulse rewards. In DSN '05: Proceedings of the 6th International Conference on Dependable Systems and Networks, Yokohama, Japan, 2005.
5. B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model-checking performability properties. In International Conference on Dependable Systems and Networks (DSN), pages 103-112. IEEE CS Press, 2002.
6. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A tool for model-checking Markov Chains. Int. Journal on Software Tools for Technology Transfer, 4(2):153-172, 2003.
7. M. A. Qureshi and W. H. Sanders. A New Methodology for Calculating Distributions of Reward Accumulated During a Finite Interval. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing, pages 116-125, Sendai, Japan, 1996.
8. H. C. Tijms and R. Veldman. A fast algorithm for the transient reward distribution in continuous-time Markov chains. Oper. Res. Lett., 26:155-158, 2000.