Stochastic model checking

Stochastic Hybrid Systems

Volumn , Issue , 2006, Pages 79-106

  Katoen, Joost Pieter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85056320503     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (60)

1. A. acquaviva, a. aldini, m. bernardo, a. bogliolo, e. bonta and E. Lattanzi. Assessing the impact of dynamic power management on the functionality and the performance of battery-powered appliances. In Dependable Systems and Networks (DSN 2004), IEEE CS Press, pp. 731-740, 2004.
2. S. Andova, H. Hermanns, J.-P. Katoen. Discrete-time rewards model-checked. In Formal Methodsfor Timed Systems, LNCS 2791:88-104,2003.
3. K.R. Apt, N. Francez and W.-P. de Roever. Aproofsystemforcommu-nicating sequential processes. ACM Transactions on Programming Languages and Systems, 2:359-385,1980.
4. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Model checking continuous time Markov chains. ACM Transactions on Computational Logic, 1(1):162-170,2000.
5. A. Aziz, V. Singhal, F. Balarin, R. Brayton and A. Sangiovanni-Vincentelli. It usually works: the temporal logic of stochastic systems. In P. Wolper, editor, Computer-Aided Verification, LNCS 939:155-165,1995.
6. C. Baier, b. Engelen, and M. Majster-Cederbaum. Deciding bisim-ilarity and similarity for probabilistic processes. J. of Comp. and System Sc., 60(1):187-231,2000.
7. C. Baier, B. Haverkort, H. Hermanns and J.-P. Katoen. On the log-ical characterisation of performability properties. In: U. Montanari, J.D.P. Rolim, E. Welzl, editors, Automata, Languages and Programming, LNCS 1853:780-792, 2000.
8. C. Baier, b. Haverkort, h. Hermanns and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6):524-541,2003.
9. C. Baier and h. Hermanns. Weak bisimulation for fully probabilistic processes. Computer-Aided Verification, LNCS 1254:119-130,1997.
10. C. Baier, J.-P. Katoen and h. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In Concurrency Theory, LNCS 1664:146-162, Springer, 1999.
11. C. Baier, h. Hermanns, J.-P. Katoen, B. Haverkort. Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theoretical Computer Science, 345(1):2-26, 2005.
12. C. Baier, J.-P. Katoen, h. Hermanns, V. Wolf. Comparative branching-time semantics for Markov chains. Information & Computation 200(2):149-214,2005.
13. C. Baier, B.R. Haverkort, h. Hermanns and J.-P. Katoen. On the logical characterisation of performability properties. In Automata, Languages, and Programming, LNCS 1853:780-792, Springer, 2000.
14. M.D. Beaudry. Performance-relatedreliability measures for computing systems. IEEE Trans. on Comp. Sys., 27(6):540-547,1978.
15. D. Bertsekas. Dynamic Programming and Optimal Control, volumes 1 and 2. Athena Scientific, 1995.
16. M. Bravetti. Revisiting interactive Markov chains. In W. Vogler and K.G. Larsen (eds), Modelsfor Time-Critical Systems, BRICS Notes Series NS-02-3, pp. 60-80, 2002.
17. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability, 31:59-75,1994.
18. P. Buchholz, J.-P. Katoen, P. Kemper and C. Tepper. Model-checking large structured Markov chains. Journal of Logic andAlgebraic Programming, 56(1-2):69-97,2003.
19. E. M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In Logic of Programs, LNCS 131:52-71,1981.
20. E.M. Clarke and R. Kurshan. Computer-aided verification. IEEE Spec-trum, 33(6):61-67,1996.
21. E.M. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, 1999.
22. L. Cloth, J.-P. Katoen, M. Khattri, R. Pulungan. Model checking Markov reward models with impulse rewards. Dependable Systems and Networks (DSN2005), pp. 722-731, IEEE CS Press, 2005.
23. C. Courcoubetis and M. Yannakakis. Verifying temporalproperties of finite-state probabilistic programs. In Found. ofComp. Sc. (FOCS), pp. 338-345, 1988.
24. M. H.A. Davis. Piecewise deterministic Markov processes: a general class of non-diffusion stochastic models. J. Royal Statistical Soc. (B), 46:353-388, 1984.
25. S. Derisavi, H. Hermanns and W.H. Sanders. Optimal state-space lumping in Markov chains. Information Processing Letters, 87(6):309-315, 2004.
26. J. Desharnais. Logical characterisation of simulation for Markov chains. Workshop on Probabilistic Methods in Verification, Tech. Rep. CSR-99-8, Univ. of Birmingham, pp. 33-48,1999.
27. J. Desharnais and P. Panangaden. Continuous stochastic logic charac-terizes bisimulation of continuous-time Markov processes. Journal of Logic andAlgebraic Programming, 56(1-2):99-115,2003.
28. D. Gross and D.R. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov chains. Op. Res., 32(2):343-361, 1984.
29. H.A. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Comp., 6(5):512-535,1994.
30. D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8(3):231-274,1987.
31. S. Hart, M. SHARIR and A. Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356-380,1983.
32. B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen and c. Baier. Model-checking performability properties. In: Dependable Systems and Networks, pp. 103-113,2002.
33. B. Haverkort, H. Hermanns, and J.-P. Katoen. On the use of model checking techniques for quantitative dependability evaluation. In IEEE Sym. on Reliable Distributed Systems (SRDS), pp. 228-238, IEEE CS Press, 2000.
34. B. Haverkort and J.-P. Katoen. The performability distribution for non-homogeneous Markov reward models. In Performability Workshop, pp. 32-34, 2005.
35. H. hermanns, j.-P. Katoen, J. meyer-Kayser and M. Siegle. A Markov chain model checker. J. on Software Tools and Technology Transfer, 4(2): 153-172,2003.
36. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge Univ. Press, 1996.
37. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12:576-580,583, 1969.
38. G.J. Holzmann. Design and Validation of Computer Protocols. (Prentice-Hall, 1991).
39. R.A. Howard. Dynamic Probabilistic Systems; Vol. I, II. John Wiley & Sons, 1971.
40. T. Hyunh and L. Tian. On some equivalence relations for probabilistic processes. Fundamentae Informatica, 17:211-234,1992.
41. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. IEEE Symp. on Logic in Comp. Sc., pp. 186-195,1989.
42. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. IEEE Symp. on Logic in Comp. Sc., pp. 266-277,1991.
43. J.-P. Katoen, M. Khattri and I.S. Zapreev. A Markov reward model checker. In: Quantitative Evaluation of Systems (QEST). IEEE CS Press, 243-245, 2005.
44. J.-P. Katoen, M.Z. Kwiatkowska, G. Norman and D. Parker. Faster and symbolic CTMC model checking. In: L. de Alfaro and S. Gilmore, editors, Process Algebra and Probabilistic Methods, LNCS 2165:23-38,2001.
45. J.-P. Katoen and I.S. Zapreev. Safe on-the-fly steady-state detection for time-bounded reachability. In: Quantitative Evaluation of Systems, IEEE CS Press, 2006 (to appear).
46. J. G. Kemeny and J.L. Snell. Finite Markov Chains. VanNostrand, 1960.
47. M.Z. Kwiatkowska, G. Norman and R. Segala. Automated verifica-tion of a randomized distributed consensus protocol using Cadence SMV and PRISM. In: G. Berry et al, editors, Computer-Aided Verification, LNCS 2102: 194-206,2001.
48. M. Kwiatkowska, G. Norman and D. Parker. Probabilistic symbolic model checking using PRISM: a hybrid approach. J. on Software Tools for Technology Transfer, 6(2):128-142,2004.
49. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf. and Comput., 94(1):1-28,1991.
50. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
51. S. Owicki and D. Gries. An axiomatic proof technique for parallel pro-grams. Acta Informatica, 6:319-340,1976.
52. M.L. Puterman. Markov Decision Processes: Discrète Stochastic Dynamic Programming. John Wiley & Sons, 1994.
53. J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In: Proceedings 5th International Symposium on Programming, LNCS 137:337-351,1982.
54. M.A. Qureshi and W.H. Sanders. A new methodology for calculating distributions of reward accumulated during a finite interval. In Fault-Tolerant Computing Symposium, IEEE CS Press, pp. 116-125,1996.
55. J. Staunstrup, H.R. Andersen, J. Lind-Nielsen, K.G. Larsen, G. behrmann, K. kristoffersen, h. leerberg and n.b. theilgaard. Practical verification of embedded software. IEEE Computer, 33(5):68-75, 2000.
56. W.J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
57. H.C. Tijms. A First Course in Stochastic Models. John Wiley & Sons, 2003.
58. H.C. Tijms and R. Veldman. A fast algorithm for the transient reward distribution in continuous-time Markov chains. Operations Research Letters, 26:155-158,2000.
59. A.M. Turing. On checking a large routine. In: Report of a Conference on High Speed Calculating Machines, pp. 76-69, 1949.
60. M.Y. Vardi. Automatic verification of probabilistic concurrent finite state programs. In IEEE Symposium on Foundations of Computer Science, pp. 327-338, 1985.