Computing Poisson probabilities
Communications of the ACM
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Faster and Symbolic CTMC Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On the Use of Model Checking Techniques for Dependability Evaluation
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Performability evaluation: where it is and what lies ahead
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
CSL model checking algorithms for QBDs
Theoretical Computer Science
Probabilistic Model Checking Modulo Theories
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Performance-Related Reliability Measures for Computing Systems
IEEE Transactions on Computers
INFAMY: An Infinite-State Markov Model Checker
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Comparative branching-time semantics for Markov chains
Information and Computation
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
CSL model checking algorithms for infinite-state structured Markov chains
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Ymer: a statistical model checker
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are a widely used modeling formalism that captures such performance and dependability properties, and makes them analyzable by model checking. In this paper, we focus on time-bounded probabilistic properties of infinite-state CTMCs, expressible in a subset of continuous stochastic logic (CSL). This comprises important dependability measures, such as time-bounded probabilistic reachability, performability, survivability, and various availability measures like instantaneous, conditional instantaneous and interval availabilities. Conventional model checkers explore the given model exhaustively, which is often costly, due to state explosion, and sometimes impossible because the model is infinite. This paper presents a method that only explores the model up to a finite depth. The required depth is determined on the fly by an algorithm that is configurable in order to adapt to the characteristics of different classes of models. We provide experimental evidence showing that our method is effective.