On the logical characterisation of performability properties

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

Volumn 1853, Issue , 2000, Pages 780-792

  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

AUTOMATA THEORY; COMPUTER CIRCUITS; MARKOV PROCESSES; MODEL CHECKING; SPECIFICATIONS; STOCHASTIC SYSTEMS;

CONTINUOUS TIME MARKOV CHAIN; CONTINUOUS-TIME; DUALITY THEOREMS; MARKOV REWARD MODEL; PERFORMABILITY; PERFORMANCE AND DEPENDABILITY MEASURES; STOCHASTIC LOGIC;

CONTINUOUS TIME SYSTEMS;

EID: 84974622233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_65     Document Type: Conference Paper

References (19)

1. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Verifying continuous time Markov chains. In CAV, LNCS 1102, pp. 269-276, 1996.
2. C. Baier, B.R. Haverkort, H. Hermanns and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In CAV, LNCS, 2000.
3. 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.
4. M.D. Beaudry. Performance-related reliability measures for computing systems. IEEE Trans. on Comp. Sys., 27(6): 540-547, 1978.
5. G. Clark, S. Gilmore, and J. Hillston. Specifying performance measures for PEPA. In Form. Meth. for Real-Time and Prob. Sys. (ARTS), LNCS 1601, pp. 211-227, 1999.
6. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Found. of Comp. Sc. (FOCS), pp. 338-345, 1988.
7. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp., 6: 512-535, 1994.
8. B.R. Haverkort and I.G. Niemegeers. Performability modelling tools and techniques. Perf. Ev., 25: 17-40, 1996.
9. B.R. Haverkort. Performance of Computer Communication Systems: A Model- Based Approach. John Wiley & Sons, 1998.
10. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser and M. Siegle. A Markov chain model checker. In TACAS, LNCS 1785, pp. 347-362, 2000.
11. R.A. Howard. Dynamic Probabilistic Systems; Vol. I, II. John Wiley & Sons, 1971.
12. J.F. Meyer. On evaluating the performability of degradable computing systems. IEEE Trans. on Comp., 29(8): 720-731, 1980.
13. J.F. Meyer. Performability evaluation: where it is and what lies ahead. In 1st IEEE Int. Comp. Perf. and Dependability Symp. (IPDS), pp. 334-343, 1995.
14. W.D. Obal and W.H. Sanders. State-space support for path-based reward variables. In 3rd IEEE Int. Comp. Perf. and Dependability Symp. (IPDS), pp. 228-237, 1998.
15. R.M. Smith, K.S. Trivedi and A.V. Ramesh. Performability analysis: measures, an algorithm and a case study. IEEE Trans. on Comp., 37(4): 406-417, 1988.
16. 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.
17. W.J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.
18. K.S. Trivedi, J.K. Muppala, S.P. Woolet, and B.R. Haverkort. Composite performance and dependability analysis. Perf. Ev., 14: 197-215, 1992.
19. M.Y. Vardi. Automatic verification of probabilistic concurrent finite state programs. Found. of Comp. Sc. (FOCS), pp 327-338, 1985