Approximate performability and dependability analysis using generalized stochastic Petri Nets
Haverkort, Boudewijn R. (1993) Approximate performability and dependability analysis using generalized stochastic Petri Nets. Performance Evaluation, 18 (1). pp. 6178. ISSN 01665316

PDF
1MB 
Abstract:  Since current day faulttolerant and distributed computer and communication systems tend to be large and complex, their corresponding performability models will suffer from the same characteristics. Therefore, calculating performability measures from these models is a difficult and timeconsuming task.
To alleviate the largeness and complexity problem to some extent we use generalized stochastic Petri nets to describe to models and to automatically generate the underlying Markov reward models. Still however, many models cannot be solved with the current numerical techniques, although they are conveniently and often compactly described. In this paper we discuss two heuristic state space truncation techniques that allow us to obtain very good approximations for the steadystate performability while only assessing a few percent of the states of the untruncated model. For a class of reversible models we derive explicit lower and upper bounds on the exact steadystate performability. For a much wider class of models a truncation theorem exists that allows one to obtain bounds for the error made in the truncation. We discuss this theorem in the context of approximate performability models and comment on its applicability. For all the proposed truncation techniques we present examples showing their usefulness. 
Item Type:  Article 
Copyright:  © 1993 Elsevier Science 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/18265 
Official URL:  http://dx.doi.org/10.1016/01665316(93)90027R 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page
Metis ID: 118785