A tool for model-checking Markov chains

International Journal on Software Tools for Technology Transfer

Volumn 4, Issue 2, 2003, Pages 153-172

  Hermanns, Holger ^a   Katoen, Joost Pieter ^a   Meyer Kayser, Joachim ^b   Siegle, Markus ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Markov chain; Model checking; Numerical mathematics; Performance evaluation; Probabilistic systems; Temporal logic

Indexed keywords

CONTINUOUS TIME MARKOV CHAIN; DEVELOPMENT AND APPLICATIONS; NUMERICAL MATHEMATICS; PERFORMANCE AND RELIABILITIES; PERFORMANCE EVALUATION; PROBABILISTIC SYSTEMS; PROTOTYPE MODELS; TEMPORAL LOGIC FORMULA;

MODEL CHECKING; TEMPORAL LOGIC; TOOLS;

MARKOV PROCESSES;

EID: 84896838954     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090100072     Document Type: Article

References (63)

1. Ajmone Marsan, M., Conte, G., Balbo, G.: A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Trans Comp Syst 2(2):93-122, 1984.
2. de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: Proc. 13th IEEE Symposium on Logic in Computational Science, pp. page typefirst454/pagex-/xpage typelast465/page, IEEE CS, 1998.
3. de Alfaro, L., Kwiatkowska, M.Z., Norman, G., Parker, D., Segala, R.: Symbolic model checking for probabilistic processes using MTBDDs and the Kronecker representation. In: Graf, S., Schwartzbach, M. (eds), Tools and Algorithms for the Analysis and Construction of Systems, Lecture Notes in Computer Science, vol. 1785. Springer, Berlin Heidelberg New York, 2000, pp. 395-410.
4. Alur, R., Courcoubetis, C., Dill, D.: Model-checking for probabilistic real-time systems. In: Albert, J.L., Monien, B., Rodŕi{dotless}guez-Artalejo, M. (eds), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 510. Springer, Berlin Heidelberg New York, 1991, pp. 115-126.
5. Alur, R., Courcoubetis, C., Dill, D.: Model checking in dense real-time. Inf Comput 104:2-34, 1993.
6. Aziz, A., Singhal, V., Balarin, F., Brayton, R., Sangiovanni- Vincentelli, A.: It usually works: the temporal logic of stochastic systems. In: Wolper, P. (ed), Computer-Aided Verification, Lecture Notes in Computer Science, vol. 939. Springer, Berlin Heidelberg New York, 1995, pp. 155-165.
7. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Verifying continuous time Markov chains. In: Alur, R., Henzinger, T.A. (eds), Computer-Aided Verification, Lecture Notes in Computer Science, vol. 1102. Springer, Berlin Heidelberg New York, 1996, pp. 269-276.
8. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model checking continuous time Markov chains. ACM Trans Comput Logic 1(1):162-170, 2000.
9. Baier, C.: On algorithmic verification methods for probabilistic systems. Habilitation thesis, Univ. of Mannheim, 1999.
10. Baier, C., Clarke, E., Hartonas-Garmhausen, V., Kwiatkowska, M., Ryan, M.: Symbolic model checking for probabilistic processes. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 1256. Springer, Berlin Heidelberg New York, 1997, pp. 430-440.
11. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model checking continuous-time Markov chains by transient analysis. In: Emerson, E.A., Sistla, A.P. (eds), Computer- Aided Verification, Lecture Notes in Computer Science, vol. 1855. Springer, Berlin Heidelberg New York, 2000, pp. 358-372.
12. Baier, C., Katoen, J.-P., Hermanns, H.: Approximate symbolic model checking of continuous-time Markov chains. In: Baeten, J., Mauw, S. (eds), Concurrency Theory, Lecture Notes in Computer Science, vol. 1664. Springer, Berlin Heidelberg New York, 1999, pp. 146-162.
13. Baier, C., Kwiatkowska, M.Z.: On the verification of qualitative properties of probabilistic processes under fairness constraints. Inf Proc Lett 66(2):71-79, 1998.
14. Baier, C., Kwiatkowska, M.Z.: Model checking for a probabilistic branching time logic with fairness. Distrib Comput 11:125-155, 1998.
15. Beauquier, D., Slissenko, A.: Polytime model checking for timed probabilistic computation tree logic. Acta Inf 35:645-664, 1998.
16. Bernardo, M., Gorrieri, R.: A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities, and time. Theor Comp Sci 202:1-54, 1998.
17. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed), Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1026. Springer, Berlin Heidelberg New York, 1995, pp. 499-513.
18. Changuion, B., Davies, I., Nelte, M.: DaNAMiCS - a Petri Net Editor. http://www.cs.uct.ac.za/Research/DNA/DaNAMiCS/
19. Christoff, I., Christoff, L.: Reasoning about safety and liveness properties for probabilistic systems. In: Shyamasundar, R.K. (ed), Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 652. Springer, Berlin Heidelberg New York, 1992, pp. 342-355.
20. Christoff, L.: Specification and verification methods for probabilistic processes. PhD thesis, Technical Report DoCs 93/37, Uppsala University, 1993.
21. Clarke, E., Emerson, E., Sistla, A.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans Program Lang Syst 8:244-268, 1998.
22. Clarke, E., Grumberg, O., Peled, D.: Model checking. MIT, Cambridge, Mass., USA, 1999.
23. Cleaveland, W.R., Parrow, J., Steffen, B.: The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Trans Program Lang Syst 15(1):36-72, 1993.
24. Conway, A.E., Georganas, N.D.: Queueing networks - exact computational algorithms. MIT Cambridge, Mass., USA, 1989.
25. Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: Proc. IEEE Symposium on the Foundations of Computational Science, pp. 338-345, IEEE CS, 1988.
26. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J ACM 42(4):857-907, 1995.
27. Deavours, D.D., Sanders, W.H.: An efficient disk-based tool for solving very large Markov models. Performance Eval 33(1):67-84, 1998.
28. Diefenbruch, M., Hintelmann, J., M̈uller-Clostermann, B.: The QUEST-approach for the performance evaluation of SDLsystems. In: Gotzhein, R., Bredereke, J. (eds), Formal Description Techniques IX, pp. 229-244, 1996.
29. Fischer, M., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J ACM 32:374-382, 1985.
30. Fox, B.L., Glynn, P.W.: Computing Poisson probabilities. Commun ACM 31(4):440-445, 1998.
31. Fredlund, L.: The timing and probability workbench: a tool for analysing timed processes. Technical Report No. 49, Uppsala University, 1994.
32. Hachtel, G., Macii, E., Padro, A., Somenzi, F.: Markovian analysis of large finite-state machines. IEEE Trans CAD Integrated Circuits Sys 15(12):1479-1493, 1996.
33. Hansson, H.A.: Time and probability in formal design of distributed systems. PhD thesis, Technical Report DoCs 91/27, Uppsala University, 1991.
34. Hansson, H.A., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput 6(5):512-535, 1994.
35. Hartonas-Garmhausen, V., Campos, S., Clarke, E.M.: Prob- Verus: probabilistic symbolic model checking. In: Katoen, J.-P. (ed), Formal Methods for Real-Time and Probabilistic Systems, Lecture Notes in Computer Science, vol. 1601. Springer, Berlin Heidelberg New York, 1999, pp. 96-111.
36. Haverkort, B.R.: Performance of computer communication systems: a model-based approach. Wiley, New York, 1998.
37. Haverkort, B.R., Niemegeers, I.G.: Performability modelling tools and techniques. Performance Eval 25:17-40, 1996.
38. Harel, D.: Statecharts: a visual formalism for complex systems. Sci Comput Program 8:231-274, 1987.
39. Hermanns, H., Katoen, J.-P., Meyer-Kayser, J., Siegle, M.: AMarkov chain model checker. In: Graf, S., Schwartzbach, M.I. (eds), Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, vol. 1785. Springer, BerlinHeidelbergNewYork, 2000, pp. 347-362.
40. Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation. Theoret Comput Sci 274(1-2): 43-87, 2002.
41. Hermanns, H., Herzog, U., Klehmet, U., Mertsiotakis, V., Siegle, M.: Compositional performance modelling with the TIPPtool. Performance Eval 39(1-4):5-35, 2000.
42. Hermanns, H., Katoen, J.-P.: Automated compositional Markov chain generation for a plain-old telephone system. Sci Comput Program 36(1):97-127, 2000.
43. Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi-terminal binary decision diagrams to represent and analyse continuoustime Markov chains. In: Proc. 3rd Int. Workshop on the Numerical Solution of Markov Chains, pp. 188-207, 1999.
44. Hermanns, H.: Construction and verification of performance and reliability models. Bull ETACS 74:135-153, 2001.
45. Hillston, J.: A compositional approach to performance modelling. Cambridge University, 1996.
46. Holzmann, G.J.: An improved protocol reachability analysis technique. Software Pract Exper 18(2):137-161, 1988.
47. Holzmann, G.J.: Design and validation of computer protocols. Prentice-Hall, Englewood Cliffs, N.J., USA, 1991.
48. Ibe, O.C., Trivedi, K.S.: Stochastic Petri net models of polling systems. IEEE J Selected Areas Commun 8(9):1649-1657, 1990.
49. Jensen, A.: Markov chains as an aid in the study of Markov processes. Skand Aktuarietidskrift 3:87-91, 1953.
50. Katoen, J.-P., Kwiatkowska, M.Z., Norman, G., Parker, D.: Faster and symbolic CTMC model checking. In: de Alfaro, L., Gilmore, S. (eds), Process Algebra and Probabilistic Method, Lecture Notes in Computer Science, vol. 2165. Springer, Berlin Heidelberg New York, 2001, pp. 23-38.
51. Kwiatkowska, M.Z., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. In: Katoen, J.-P. (ed), Formal Methods for Real-Time and Probabilistic Systems, Lecture Notes in Computer Science, vol. 1601. Springer, Berlin Heidelberg New York, 1999, pp. 75-95.
52. Kwiatkowska, M.Z., Norman, G., Segala, R., Sproston, J.: Verifying quantitative properties of continuous probabilistic timed automata. In: Palamidessi, C. (ed), Concurrency Theory, Lecture Notes in Computer Science, vol. 1877. Springer, Berlin Heidelberg New York, 2000, pp. 123-137.
53. Martin, P.-E.: Vopp: a verification tool for probabilistic processes. MSc thesis, Uppsala University, 1993.
54. McMillan, K.L.: Symbolic model checking. Kluwer Academic, Boston, Mass., USA, 1993.
55. Muppala, J.K., Trivedi, K.S.: Numerical transient solution of finite Markovian queueing systems. In: Bhat, U. (ed), Queueing and Related Models, Oxford University, 1992.
56. Peled, D.: Combining partial order reductions with on-the-fly model checking. Formal Methods Syst Des 8:39-64, 1996.
57. Pnueli, A., Zuck, L.: Probabilistic verification. Inf Comput 103:1-29, 1993.
58. Pooley, R., King, P.: Derivation of Petri net performance models from UML specifications of communications software. In: Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U. (eds), Computer Performance Evaluation, Lecture Notes in Computer Science, vol. 1786. Springer, Berlin Heidelberg New York, 2000, pp. 262-276.
59. Press, W., Flannery, B., Teukolsky, S., Vetterling, W.: Numerical recipes in C: the art of scientific computing. Cambridge University, 1989.
60. Shiryaev, A.N.: Probability. Graduate Texts in Mathematics, Springer, Berlin Heidelberg New York, 1989.
61. Stewart, W.: Introduction to the numerical solution of Markov chains. Princeton University, 1994.
62. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J Comput 1:146-160, 1972.
63. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Proc. IEEE Symposium on the Foundations of Computational Science, pp. 327-338, 1985