Skip to main content

Dependability Modeling Using Petri-Nets

Publication ,  Journal Article
Malhotra, M; Trivedi, KS
Published in: IEEE Transactions on Reliability
January 1, 1995

This paper describes a methodology to construct dependability models using generalized stochastic Petri nets (GSPN) and stochastic reward nets (SRN). Algorithms are provided to convert a fault tree (a commonly used combinatorial model type) model into equivalent GSPN and SRN models. In a fault-tree model, various kinds of distributions can be assigned to components such as defective failure-time distribution, non-defective failure-time distribution, or a failure probability. The paper describes subnet constructions for each of these different cases, and shows how to incorporate repair in these models. We consider the cases: 1) Each component has an independent repair facility. 2) Several components share a repair facility; such repair dependency cannot be modeled by combinatorial model types such as fault trees. We illustrate how such dependencies and various scheduling disciplines (for the repair queue) such as first-come first-served (FCFS), processor-sharing, preemptive priority with resume, and non-preemptive priority repair, can be modeled by GSPN & SRN. If the operational dependence of a system on its components is specified by means of a fault-tree and a repair dependence is described in some (other) form, then our methodology provides an automatic way to generate GSPN & SRN models of system dependability. The subnet constructions allow us to compare SRN with GSPN as dependability model types. For the dependability models of repairable systems, the complexity (number of places and transitions) of GSPN models is appreciably higher than the complexity of equivalent SRN models. The state-space of the underlying continuous-time Markov chain (CTMC) remains the same, however. Thus SRN reduce the complexity of model specification at the net level, but the complexity of model solution remains the same. Since SRN include all the features of GSPN, the additional features of SRN such as reward rates, variable cardinality arcs, halting condition, and timed transition priorities, greatly simplify model construction & specification. © 1995 IEEE

Duke Scholars

Published In

IEEE Transactions on Reliability

DOI

EISSN

1558-1721

ISSN

0018-9529

Publication Date

January 1, 1995

Volume

44

Issue

3

Start / End Page

428 / 440

Related Subject Headings

  • Operations Research
  • 4612 Software engineering
  • 4010 Engineering practice and education
  • 0906 Electrical and Electronic Engineering
  • 0803 Computer Software
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Malhotra, M., & Trivedi, K. S. (1995). Dependability Modeling Using Petri-Nets. IEEE Transactions on Reliability, 44(3), 428–440. https://doi.org/10.1109/24.406578
Malhotra, M., and K. S. Trivedi. “Dependability Modeling Using Petri-Nets.” IEEE Transactions on Reliability 44, no. 3 (January 1, 1995): 428–40. https://doi.org/10.1109/24.406578.
Malhotra M, Trivedi KS. Dependability Modeling Using Petri-Nets. IEEE Transactions on Reliability. 1995 Jan 1;44(3):428–40.
Malhotra, M., and K. S. Trivedi. “Dependability Modeling Using Petri-Nets.” IEEE Transactions on Reliability, vol. 44, no. 3, Jan. 1995, pp. 428–40. Scopus, doi:10.1109/24.406578.
Malhotra M, Trivedi KS. Dependability Modeling Using Petri-Nets. IEEE Transactions on Reliability. 1995 Jan 1;44(3):428–440.

Published In

IEEE Transactions on Reliability

DOI

EISSN

1558-1721

ISSN

0018-9529

Publication Date

January 1, 1995

Volume

44

Issue

3

Start / End Page

428 / 440

Related Subject Headings

  • Operations Research
  • 4612 Software engineering
  • 4010 Engineering practice and education
  • 0906 Electrical and Electronic Engineering
  • 0803 Computer Software