Automated performance and dependability evaluation using model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2459, Issue , 2002, Pages 261-289

  Baier, Christel ^a   Haverkort, Boudewijn ^b   Hermanns, Holger ^c   Katoen, Joost Pieter ^c  

^a UNIVERSITY OF BONN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; PETRI NETS; SPECIFICATIONS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

COMPUTER COMMUNICATIONS; CONTINUOUS TIME MARKOV CHAIN; DEPENDABILITY EVALUATION; LOGIC BASED SPECIFICATION; MODEL-CHECKING TECHNIQUES; STATE-SPACE GENERATION; STOCHASTIC PETRI NETS; STOCHASTIC PROCESS ALGEBRAS;

MODEL CHECKING;

EID: 84957049118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45798-4_12     Document Type: Conference Paper

References (60)

1. 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.
2. 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-Verlag, 1999.
3. C. Baier, B.R. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Computer Aided Verification, LNCS 1855: 358–372, Springer-Verlag, 2000.
4. 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-Verlag, 2000.
5. C. Baier, B.R. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking algorithms for continuous-time Markov chains. Technical report TR-CTIT-02-10. Centre for Telematics and Information Technology, University of Twente. 2001.
6. C. Baier and M. Kwiatkowska. On the verification of qualitative properties of probabilistic processes under fairness constraints. Information Processing Letters, 66(2): 71–79, 1998.
7. M.D. Beaudry. Performance-related reliability measures for computing systems. IEEE Transactions on Computers, C-27: 540–547, 1978.
8. B. Bèrard, M. Bidoit, A. Finkel, F. Laroussine, A. Petit, L. Petrucci, and Ph. Schnoebelen. Systems and Software Verification. Springer-Verlag, 2001.
9. A. Bobbio and M. Telek. Markov regenerative SPN with non-overlapping activity cycles. In Proc. Int’l IEEE Performance and Dependability Symposium: 124–133, 1995.
10. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability, 31: 59–75, 1994.
11. P. Buchholz, J.-P. Katoen, P. Kemper, and C. Tepper. Model checking large structured Markov chains. Journal of Logic and Algebraic Programming, to appear, 2001.
12. CCITT Blue Book, Fascicle III.1, International Telecommunication Union, Geneva, 1989.
13. G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo. GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets. Performance Evaluation, 24 (1-2):47-68, 1995.
14. G. Ciardo, J.K. Muppala, and K.S. Trivedi. SPNP: stochastic Petri net package. In Proc. 3rd Int. Workshop on Petri Nets and Performance Models, pp. 142–151, IEEE CS Press, 1989.
15. G. Clark, S. Gilmore, and J. Hillston. Specifying performance measures for PEPA. In Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601: 211–227, Springer-Verlag, 1999.
16. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8: 244–263, 1986.
17. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
18. E. Clarke and R. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6): 61–67, 1996.
19. J. Desharnais and P. Panangaden. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. Journal of Logic and Algebraic Programming, to appear, 2001.
20. S. Derisavi, H. Hermanns, and W.H. Sanders. Optimal state space lumping in Markov models. 2002. submitted for publication.
21. W. Feller. An Introduction to Probability Theory and its Applications. John Wiley & Sons, 1968.
22. R. German. Performance Analysis of Communication Systems: Modeling with Non- Markovian Stochastic Petri Nets. John Wiley & Sons, 2000.
23. S. Gilmore and J. Hillston. The PEPA workbench: a tool to support a process algebra-based approach to performance modelling. In Computer Performance Evaluation, Modeling Techniques and Tools, LNCS 794: 353-368, Springer-Verlag, 1994.
24. A. Goyal and A.N. Tantawi. A measure of guaranteed availability and its numerical evaluation. IEEE Transactions on Computers, 37: 25–32, 1988.
25. W.K. Grassmann. Finding transient solutions in Markovian event systems through randomization. In Numerical Solution of Markov Chains, pp. 357–371, Marcel Dekker Inc, 1991.
26. D. Gross and D.R. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov chains. Operations Research 32(2): 343–361, 1984.
27. D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8: 231–274, 1987.
28. B.R. Haverkort. Performance of Computer Communication Systems: A Model- Based Approach. John Wiley & Sons, 1998.
29. B.R. Haverkort, R. Marie, G. Rubino, and K.S. Trivedi (editors). Performability Modelling: Techniques and Tools. John Wiley & Sons, 2001.
30. B.R. Haverkort and I. Niemegeers. Performability modelling tools and techniques. Performance Evaluation, 25: 17–40, 1996.
31. B.R. Haverkort, H. Hermanns, and J.-P. Katoen. The use of model checking techniques for quantitative dependability evaluation. In IEEE Symposium on Reliable Distributed Systems., pp. 228–238. IEEE CS Press, 2000.
32. B.R. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model checking CSRL-specified performability properties. In 5th Int. Workshop on Performability Modeling of Computer and Communication Systems, Erlangen, Arbeitsberichte des IMMD, 34 (13), 2001. 2001.
33. B.R. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model checking performability properties. In Proc. IEEE Int’l Conference on Dependable Systems and Networks, IEEE CS press, 2002.
34. H. Hermanns. Construction and verfication of performance and reliability models. Bulletin of the EATCS, 74:135-154, 2001.
35. H. Hermanns, U. Herzog, and J.-P. Katoen. Process algebra for performance evaluation. Theoretical Computer Science, 274(1-2):43–87, 2002.
36. H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis, and M. Siegle. Compositional performance modelling with the TIPPtool. Performance Evaluation, 39(1-4): 5–35, 2000.
37. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A Markov chain model checker. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785: 347–362, Springer-Verlag, 2000.
38. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. Towards model checking stochastic process algebra. In Integrated Formal Methods, LNCS 1945: 420–439, Springer-Verlag, 2000.
39. H. Hermanns and M. Siegle. Bisimulation algorithms for stochastic process algebras and their BDD-based implementation. In Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601: 244–265, Springer-Verlag, 1999.
40. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
41. G.J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5): 279–295, 1997.
42. G. Horton, V. Kulkarni, D. Nicol, K. Trivedi. Fluid stochastic Petri nets: Theory, application and solution techniques. Eur. J. Oper. Res., 105(1): 184–201,1998.
43. R.A. Howard. Dynamic Probabilistic Systems; Volume 1: Markov Models. John Wiley & Sons, 1971.
44. G.G. Infante-Lopez, H. Hermanns, and J.-P. Katoen. Beyond memoryless distributions: Model checking semi-Markov chains. In Process Algebra and Probabilistic Methods, LNCS 2165: 57–70, Springer-Verlag, 2001.
45. A. Jensen. Markov chains as an aid in the study of Markov processes. Skandinavisk Aktuarietidskrift 36: 87–91, 1953.
46. J.-P. Katoen, M.Z. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In Process Algebra and Probabilistic Methods, LNCS 2165: 23–38, Springer-Verlag, 2001.
47. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Van Nostrand, 1960.
48. V.G. Kulkarni. Modeling and Analysis of Stochastic Systems. Chapman & Hall, 1995.
49. M.Z. Kwiatkowska, G. Norman, and A. Pacheco. Model checking CSL until formulae with random time bounds. In Process Algebra and Probabilistic Methods, LNCS 2399, Springer-Verlag, 2002.
50. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
51. J.F. Meyer. On evaluating the performability of degradable computing systems. IEEE Transactions on Computers, 29(8): 720–731, 1980.
52. J.F. Meyer. Closed-form solutions of performability, IEEE Transactions on Computers, 31(7): 648–657, 1982.
53. J.F. Meyer. Performability: a retrospective and some pointers to the future. Performance Evaluation, 14(3-4): 139–156, 1992.
54. W.D. Obal II and W.H. Sanders. State-space support for path-based reward variables. Performance Evaluation, 35: 233–251, 1999.
55. D. Peled. Software Reliability Methods. Springer-Verlag, 2001.
56. W.H. Sanders, W.D. Obal II, M.A. Qureshi, and F.K. Widnajarko. The UltraSAN modeling environment. Performance Evaluation, 24: 89–115, 1995.
57. B. Sericola. Occupation times in Markov processes. Stochastic Models, 16(5): 339–351, 2000.
58. E. de Souza e Silva and H.R. Gail. Performability analysis of computer systems: from model specification to solution. Perf. Ev., 14: 157–196, 1992.
59. W.J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
60. H.C. Tijms, R. Veldman. A fast algorithm for the transient reward distribution in continuous-time Markov chains, Operation Research Letters, 26: 155–158, 2000.