Approximate performability analysis using generalized stochastic Petri nets
Boudewijn R. Haverkort
- 02 Dec 1991
- pp 300-309
TL;DR: The author discusses two heuristic state space truncation techniques that allow us to obtain very good approximations while only assessing a few percent of the overall state space.
read more
Abstract: Addresses the problem of calculating performability measures from performability models of fault-tolerant computer systems. Since these systems tend to be large and complex, the corresponding performability models will in general also be large and complex. To alleviate the largeness problem to some extent the author uses generalized stochastic Petri nets to describe the models. Still however, many models cannot be solved with the current numerical techniques, although they are conveniently and often compactly described. In the paper the author discusses two heuristic state space truncation techniques that allow us to obtain very good approximations while only assessing a few percent of the overall state space. He gives examples of the usage, but also theoretical evidence in the correctness of the employed truncation techniques. He furthermore shows that GSPNs are very suitable for implementing (describing) the proposed truncation techniques. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Techniques and tools for reliability and performance evaluation: problems and perspectives
TL;DR: A broad range of existing techniques of systems analysis can be found in this paper, where the authors discuss some of the issues involved in integrating modeling and design during a product development process and describe a variety of tools that have been developed to make the analysis process simpler.
•Dissertation
Réseaux d'Automates Stochastiques : Analyse transitoire en temps continu et algèbre tensorielle pour une sémantique en temps discret
Leonardo Brenner
- 16 Sep 2009
TL;DR: Cette these presente des methodes et des algorithmes pour l'evaluation de performance de modeles avec tres grands espace d'etats decrits par des formalismes de haut niveau dans le cadre des Reseaux d'Automates Stochastiques.
4
A mean-value analysis of slotted-ring network models
TL;DR: It can be concluded that slotted-rings have very attractive performance characteristics, even under overload conditions (there is no “thrashing”), and the proposed MVA for the product-form SPN models should be regarded as a “quick engineering” tool.
3
A brief survey and synthesis of the roles of time in petri nets
TL;DR: The nature of the semantics of different approaches to incorporating time in Petri nets is illustrated by examples and the critical roles of conflict, confusion and concurrence in the formulation of execution policies are considered.
References
•Book
Introduction to Queueing Networks
Erol Gelenbe,Guy Pujolle,J. C. C. Nelson +2 more
- 01 Feb 1987
TL;DR: A comparison of G-Networks with Multiple Classes of Signals and Positive Customers and Discrete-Time Queueing Systems shows how different approaches to queue management can produce different results.
914
Composite performance and dependability analysis
Kishor S. Trivedi,Jogesh K. Muppala,Steve Woolet,Boudewijn R. Haverkort +3 more
- 01 Jan 1991
TL;DR: In this paper, an introduction to Markov reward models including solution techniques and application examples is presented, and a brief discussion of how task completion time models and models of queues with breakdowns and repairs relate to MarkOV reward models is also given.
146
Bounding availability of repairable computer systems
Richard R. Muntz,E. de Souza e Silva,Ambuj Goyal +2 more
- 01 Apr 1989
TL;DR: An approximation technique for determining steady state availability is presented and of particular interest is that the method also provides bounds on the error.
89
Bounding availability of repairable systems
TL;DR: An approximation technique is presented for determining steady-state availability and of particular interest is that the method also provides bounds on the error.
85