A Markov chain model checker

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

Volumn 1785 LNCS, Issue , 2000, Pages 347-362

  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

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; TEMPORAL LOGIC; CHAINS;

CONTINUOUS TIME MARKOV CHAIN; CONTINUOUS-TIME; DEVELOPMENT AND APPLICATIONS; MARKOV CHAIN MODELS; NON-TRIVIAL; PERFORMANCE AND RELIABILITIES; PROTOTYPE MODELS; TEMPORAL LOGIC FORMULA;

MODEL CHECKING;

EID: 84863955305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_24     Document Type: Conference Paper

References (29)

1. M. Ajmone Marsan, G. Conte, and G. Balbo. A class of generalised stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Tr. on Comp. Sys., 2(2): 93-122, 1984.
2. L. de Alfaro, M.Z. Kwiatkowska, G. Norman, D. Parker and R. Segala. Symbolic model checking for probabilistic processes using MTBDDs and the Kronecker representation. In TACAS, LNCS (this volume), 2000.
3. 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: 155-165, 1995.
4. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Verifying continuous time Markov chains. In CAV, LNCS 1102: 269-276, 1996. (Pubitemid 126101287)
5. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation thesis, Univ. of Mannheim, 1999.
6. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In ICALP, LNCS 1256: 430-440, 1997. (Pubitemid 127097759)
7. C. Baier, B.R. Haverkort, H. Hermanns and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. 2000 (submitted).
8. C. Baier, J.-P. Katoen and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In CONCUR, LNCS 1664: 146-162, 1999.
9. C. Baier and M. Kwiatkowska. On the verification of qualitative properties of probabilistic processes under fairness constraints. Inf. Proc. Letters, 66(2): 71-79, 1998. (Pubitemid 128393190)
10. I. Christoff and L. Christoff. Reasoning about safety and liveness properties for probabilistic systems. In FSTTCS, LNCS 652: 342-355, 1992.
11. E.M. Clarke, E.A. Emerson and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Tr. on Progr. Lang. and Sys., 8(2): 244-263, 1986. (Pubitemid 16633197)
12. A.E. Conway and N.D. Georganas. Queueing Networks - Exact Computational Algorithms. MIT Press, 1989.
13. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proc. IEEE Symp. on Found. of Comp. Sci., pp. 338-345, 1988.
14. D.D. Deavours and W.H. Sanders. An efficient disk-based tool for solving very large Markov models. In Comp. Perf. Ev., LNCS 1245: 58-71, 1997. (Pubitemid 127075178)
15. L. Fredlund. The timing and probability workbench: a tool for analysing timed processes. Tech. Rep. No. 49, Uppsala Univ., 1994.
16. G. Hachtel, E. Macii, A. Padro and F. Somenzi. Markovian analysis of large finite-state machines. IEEE Tr. on CAD of Integr. Circ. and Sys., 15(12): 1479-1493, 1996. (Pubitemid 126780410)
17. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp., 6(5): 512-535, 1994.
18. V. Hartonas-Garmhausen, S. Campos and E.M. Clarke. PROBVERUS: probabilistic symbolic model checking. In ARTS, LNCS 1601: 96-111, 1999.
19. B.R. Haverkort. Performance of Computer Communication Systems: A Model-Based Approach. John Wiley & Sons, 1998.
20. B.R. Haverkort and I.G. Niemegeers. Performability modelling tools and techniques. Perf. Ev., 25: 17-40, 1996. (Pubitemid 126404879)
21. H. Hermanns, U. Herzog and J.-P. Katoen. Process algebra for performance evaluation. Th. Comp. Sci., 2000 (to appear).
22. H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis and M. Siegle. Compositional performance modelling with the TIPPTOOL. Perf. Ev., 39(1-4): 5-35, 2000. (Pubitemid 30560229)
23. H. Hermanns, J. Meyer-Kayser and M. Siegle. Multi-terminal binary decision diagrams to represent and analyse continuous-time Markov chains. In Proc. 3rd Int. Workshop on the Num. Sol. of Markov Chains, pp. 188-207, 1999.
24. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
25. O.C. Ibe and K.S. Trivedi. Stochastic Petri net models of polling systems. IEEE J. on Sel. Areas in Comms., 8(9): 1649-1657, 1990.
26. B. Plateau and K. Atif, Stochastic automata networks for modeling parallel systems. IEEE Tr. on Softw. Eng., 17(10): 1093-1108, 1991. (Pubitemid 21722752)
27. W. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.
28. R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. of Comp., 1: 146-160, 1972.
29. M.Y. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proc. IEEE Symp. on Found. of Comp. Sci., pp. 327-338, 1985.