Scholars@Duke

Dependability and performability analysis

Publication ,  Conference
Trivedi, KS; Ciardo, G; Malhotra, M; Sahner, RA
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
January 1, 1993
Published version (DOI)

In this tutorial, we discuss several practical issues regarding specification and solution of dependability and performability models. We compare model types with and without rewards. Continuous-time Markov chains (CTMCs) are compared with (continuous-time) Markov reward models (MRMs) and generalized stochastic Petri nets (GSPNs) are compared with stochastic reward nets (SRNs). It is shown that reward-based models could lead to more concise model specification and solution of a variety of new measures. With respect to the solution of dependability and performability models, we identify three practical issues: largeness, stiffness, and non-exponentiality, and we discuss a variety of approaches to deal with them, including some of the latest research efforts.

Duke Scholars

Kishor S. Trivedi
Author Kishor S. Trivedi Electrical and Computer Engineering

Published In

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

DOI

10.1007/bfb0013869

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 1993

Volume

729 LNCS

Start / End Page

587 / 612

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Trivedi, K. S., Ciardo, G., Malhotra, M., & Sahner, R. A. (1993). Dependability and performability analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 729 LNCS, pp. 587–612). https://doi.org/10.1007/bfb0013869
Trivedi, K. S., G. Ciardo, M. Malhotra, and R. A. Sahner. “Dependability and performability analysis.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 729 LNCS:587–612, 1993. https://doi.org/10.1007/bfb0013869.
Trivedi KS, Ciardo G, Malhotra M, Sahner RA. Dependability and performability analysis. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1993. p. 587–612.
Trivedi, K. S., et al. “Dependability and performability analysis.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 729 LNCS, 1993, pp. 587–612. Scopus, doi:10.1007/bfb0013869.
Trivedi KS, Ciardo G, Malhotra M, Sahner RA. Dependability and performability analysis. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1993. p. 587–612.

Published In

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

DOI

10.1007/bfb0013869

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 1993

Volume

729 LNCS

Start / End Page

587 / 612

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences