Representation and optimization of software usage models with non-Markovian state transitions

We extend Markov usage models by admitting non-Markovian transitions between states. The suggested description syntax preserves the visualization capacities of Markov models and, although it is kept simple, provides the computational power of a universal programming language. It is shown that a prev...

Full description

Saved in:
Bibliographic Details
Published inInformation and software technology Vol. 42; no. 12; pp. 873 - 887
Main Authors Doerner, K., Gutjahr, W.J.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.09.2000
Elsevier Science Ltd
Subjects
Markov analysis
Markov chain
Markov usage model
Optimization techniques
Software
Software dependability
Software testing
Software usage model
Studies
Markov chain
Software testing
Software dependability
Markov usage model
Software usage model
Online AccessGet full text

Cover

More Information
Summary:We extend Markov usage models by admitting non-Markovian transitions between states. The suggested description syntax preserves the visualization capacities of Markov models and, although it is kept simple, provides the computational power of a universal programming language. It is shown that a previously introduced optimization technique for computing optimal test transition probabilities can be generalized to the presented framework. A medium-size example from a real-world application illustrates the approach.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0950-5849
1873-6025
DOI:10.1016/S0950-5849(00)00120-8