Results 1 -
6 of
6
A survey on the taxonomy for Cluster-based Routing Protocols for homogeneous wireless sensor networks
- ISSN 1424-8220. IJCA TM : www.ijcaonline.org
"... sensors ..."
(Show Context)
LTL model checking of time-inhomogeneous Markov chains
- in Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
, 2009
"... Abstract. We investigate the problem of verifying linear-time properties against inhomogeneous continuous-time Markov chains (ICTMCs). A fundamental ques-tion we address is how to compute reachability probabilities. We consider two variants: time-bounded and unbounded reachability. It turns out that ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract. We investigate the problem of verifying linear-time properties against inhomogeneous continuous-time Markov chains (ICTMCs). A fundamental ques-tion we address is how to compute reachability probabilities. We consider two variants: time-bounded and unbounded reachability. It turns out that both can be characterized as the least solution of a system of integral equations. We show that for the time-bounded case, the obtained integral equations can be transformed into a system of ordinary differential equations; for the time-unbounded case, we identify two sufficient conditions, namely the eventually periodic assumption and the eventually uniform assumption, under which the problem can be reduced to solving a time-bounded reachability problem for the ICTMCs and a reachability problem for a DTMC. These results provide the basis for a model checking algo-rithm for LTL. Under the eventually stable assumption, we show how to compute the probability of a set of ICTMC paths which satisfy a given LTL formula. By an automata-based approach, we reduce this problem to the previous established results for reachability problems. 1
A Catalog of Techniques that Predict Information about the Count or Rate of Field Defects
, 2006
"... assurance, reliability, risk management, planning, software reliability growth models, ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
assurance, reliability, risk management, planning, software reliability growth models,
Transient Reward Approximation for Continuous-Time Markov Chains
"... Abstract We are interested in the analysis of very large continuoustime Markov chains (CTMCs) with many distinct rates. Such models arise naturally in the context of reliability analysis, e. g., of computer network performability analysis, of power grids, of computer virus vulnerability, and in the ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract We are interested in the analysis of very large continuoustime Markov chains (CTMCs) with many distinct rates. Such models arise naturally in the context of reliability analysis, e. g., of computer network performability analysis, of power grids, of computer virus vulnerability, and in the study of crowd dynamics. We use abstraction techniques together with novel algorithms for the computation of bounds on the expected final and accumulated rewards in continuous-time Markov decision processes (CTMDPs). These ingredients are combined in a partly symbolic and partly explicit (symblicit) analysis approach. In particular, we circumvent the use of multi-terminal decision diagrams, because the latter do not work well if facing a large number of different rates. We demonstrate the practical applicability and efficiency of the approach on two case studies.
A Detailed Study of NHPP Software Reliability Models (Invited Paper)
"... Abstract—Software reliability deals with the probability that software will not cause the failure of a system for a specified time under a specified condition. The probability is a function of the inputs to and use of the system as well as a function of the existing faults in the software. The input ..."
Abstract
- Add to MetaCart
Abstract—Software reliability deals with the probability that software will not cause the failure of a system for a specified time under a specified condition. The probability is a function of the inputs to and use of the system as well as a function of the existing faults in the software. The inputs to the system determine whether existing faults, if any, are encountered. Software Reliability Models (SRMs) provide a yardstick to predict future failure behavior from known or assumed characteristics of the software, such as past failure data. Different types of SRMs are used for different phases of the software development life-cycle. With the increasing demand to deliver quality software, software development organizations need to manage quality achievement and assessment. While testing a piece of software, it is often assumed that the correction of errors does not introduce any new errors and the reliability of the software increases as bugs are uncovered and then fixed. The models used during the testing phase are called Software Reliability Growth Models (SRGM). Unfortunately, in industrial practice, it is difficult to decide the time for software release. An important step towards remediation of this problem lies in the ability to manage the testing resources efficiently and affordably. This paper presents a detailed study of existing SRMs based on Non-Homogeneous Poisson Process (NHPP), which claim to improve software quality through effective detection of software faults.
