Dependability for Systems with a Partitioned State Space [electronic resource] : Markov and Semi-Markov Theory and Computational Implementation /

Probabilistic models of technical systems are studied here whose finite state space is partitioned into two or more subsets. The systems considered are such that each of those subsets of the state space will correspond to a certain performance level of the system. The crudest approach differentiates between 'working' and 'failed' system states only. Another, more sophisticated, approach will differentiate between the various levels of redundancy provided by the system. The dependability characteristics examined here are random variables associated with the state space's partitioned structure; some typical ones are as follows • The sequence of the lengths of the system's working periods; • The sequences of the times spent by the system at the various performance levels; • The cumulative time spent by the system in the set of working states during the first m working periods; • The total cumulative 'up' time of the system until final breakdown; • The number of repair events during a fmite time interval; • The number of repair events until final system breakdown; • Any combination of the above. These dependability characteristics will be discussed within the Markov and semi-Markov frameworks.

Bibliographic Details

Main Authors:	Csenki, Attila. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	New York, NY : Springer New York, 1994
Subjects:	Mathematics., Computer mathematics., Probabilities., Probability Theory and Stochastic Processes., Computational Mathematics and Numerical Analysis.,
Online Access:	http://dx.doi.org/10.1007/978-1-4612-2674-1
Tags:	Add Tag No Tags, Be the first to tag this record!