Model checking continuous-Time Markov chains by transient analysis

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

Volumn 1855, Issue , 2000, Pages 358-372

  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

COMPUTER AIDED ANALYSIS; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; MODEL CHECKING; SPECIFICATIONS; STOCHASTIC SYSTEMS;

COMPARISON OPERATORS; CONTINUOUS STOCHASTIC LOGIC; CONTINUOUS TIME MARKOV CHAIN; PROBABILITY P; REAL INTERVALS; STEADY STATE PROPERTIES; TIMING PROPERTIES; TRANSIENT STATE;

TRANSIENT ANALYSIS;

EID: 84944391391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_28     Document Type: Conference Paper

References (28)

1. M. Ajmone Marsan, G. Balb o, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, 1995.
2. A. Aziz, V. Singhal, F. Balarin, R. Brayton and A. Sangiovanni-Vincentelli. It usually works: the temporal logic of stochastic systems. In CAV, LNCS 939, pp. 155–165, 1995.
3. A. Aziz, K. Sanwal, V. Singhal and R. Bra yton. Verifying continuous time Markov chains. In CAV, LNCS 1102, pp. 269–276, 1996.
4. I. Bahar, E. F rohm, C. Gaona, G. Hac htel, E. Macii, A. P adro and F. Somenzi. Algebraic decision diagrams and their applications. Form. Meth. in Syst. Design, 10(2/3): 171–206, 1997.
5. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation thesis, Univ. of Mannheim, 1999.
6. C. Baier, J. -P. Katoen and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In CONCUR, LNCS 1664, pp. 146–162, 1999.
7. C. Baier, B. Haverkort, H. Hermanns and J. -P. Katoen. On the logical characterisation of performability properties. In ICALP, LNCS, 2000 (to appear).
8. M. Brown, E. Clarke, O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Th. Comp. Sc., 59: 115–131, 1988.
9. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Comp., C-35(8): 677–691, 1986.
10. P. Buchholz: Exact and ordinary lumpability in finite Markov chains. J. of Appl. Prob., 31: 59–75, 1994.
11. P. Buchholz. Markovian process algebra. Tech. Rep. 500, Fachbereich Informatik, Univ. of Dortmund, 1994.
12. E. Clarke, M. Fujita, P. McGeer, J. Yang and X. Zhao. Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. In Proc. IEEE Int. Workshop on Logic Synthesis, pp. 1–15, 1993.
13. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proc. IEEE Symp. on Found. of Comp. Sc., pp. 338–345, 1988.
14. B. L. Fox and P. W. Glynn. Computing Poisson probabilities. Comm. of the ACM 31(4): 440–445, 1988.
15. W. K. Grassmann. Finding transient solutions in Markovian event systems through randomization. In W. J. Stewart, ed, Num. Sol. of Markov Chains, pp. 357–371, Marcel Dekker, 1991.
16. D. Gross and D. R. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov chains. Oper. Res. 32(2): 343–361, 1984.
17. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp. 6: 512–535, 1994.
18. B. R. Haverkort. Performance of Computer Communication Systems: A Model- Based Approach. John Wiley & Sons, 1998.
19. B. R. Haverkort and I. Niemegeers. Performability modelling tools and techniques. Perf. Ev., 25: 17–40, 1996.
20. H. Hermanns, U. Herzog and J. -P. Katoen. Process algebra for performance evaluation. Th. Comp. Sc., 2000 (to appear).
21. H. Hermanns and J. -P. Katoen. Automated compositional Markov chain generation for a plain-old telephone system. Sci. of Comp. Programming, 36(1): 97–127, 2000.
22. H. Hermanns, J. -P. Katoen, J. Meyer-Kayser and M. Siegle. A Markov chain model checker. In TACAS, LNCS 1785, pp. 347–362, 2000.
23. H. Hermanns and M. Siegle. Bisimulation algorithms for stochastic process algebras and their BDD-based implementation. In ARTS, LNCS 1601, pp. 244–265, 1999.
24. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
25. A. Jensen. Markov chains as an aid in the study of Markov processes. Skand. Aktuarietidskrift 3: 87–91, 1953.
26. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf. and Comp., 94(1): 1–28, 1992.
27. A. P. A. van Moorsel and B. R. Haverkort. Probabilistic evaluation for the analytical solution of large Markov models. Microelectron. and Reliab. 36(6): 733–755, 1996.
28. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.