Model-Checking Algorithms for Continous- Time Markov Chains
ثبت نشده
چکیده
منابع مشابه
Model Checking Infinite-State Markov Chains
In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state continuous-time Markov chains, to an important class of infinite-state Markov chains. We present synta...
متن کاملModel Checking of Open Interval Markov Chains
We consider the model checking problem for interval Markov chains with open intervals. Interval Markov chains are generalizations of discrete time Markov chains where the transition probabilities are intervals, instead of constant values. We focus on the case where the intervals are open. At first sight, open intervals present technical challenges, as optimal (min, max) value for reachability m...
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملBeyond Memoryless Distributions: Model Checking Semi-Markov Chains
Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a rather efficient manner. The state holding time distributions in CTMCs are restricted to negative exponential distributions. This paper investigates model checking of semi-Markov chains (SMCs), a model in which state holding ti...
متن کاملProbabilistic model checking: formalisms and algorithms for discrete and real-time systems
This paper considers the problem of veriication of proba-bilistic systems, for both the discrete-and real-time cases. Probabilistic systems are modeled as Markov chains, concurrent Markov chains (i.e. MCs with non-determinism) or, in the real-time case, generalized semi-Markov processes (Markovian processes with time delays on events). Discrete-time speciications are described in the logics PTL...
متن کامل