The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Model-checking algorithms for continuous-time markov chains
Abstract
Continuous-time Markov chains (CTMCs) have been widely used to determine system performance and dependability characteristics. Their analysis most often concerns the computation of steady-state and transient-state probabilities. This paper introduces a branching temporal logic for expressing real-time probabilistic properties on CTMCs and presents approximate model checking algorithms for this logic. The logic, an extension of the continuous stochastic logic CSL of Aziz et al. (1995, 2000), contains a time-bounded until operator to express probabilistic timing properties over paths as well as an operator to express steady-state probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded until and the steady-state operator) and a Volterra integral equation system (for time-bounded until). We then show that the problem of model-checking time-bounded until properties can be reduced to the problem of computing transient state probabilities for CTMCs. This allows the verification of probabilistic timing properties by efficient techniques for transient analysis for CTMCs such as uniformization. Finally, we show that a variant of lumping equivalence (bisimulation), a well-known notion for aggregating CTMCs, preserves the validity of all formulas in the logic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Clarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
Alur, R., & Dill, D. L. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90010-8 · Cited by 6,689
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
An Introduction to Probability Theory and Its Applications.
Bharucha-Reid, A. T., & Feller, W. (1967) · The American Mathematical Monthly · doi:10.2307/2314609 · Cited by 6,066
Numerical Recipes--The Art of Scientific Computing.
Fritsch, F. N., Press, W. H., Flannery, B. P., Teukolsky, S. A., & Vetterling, W. T. (1988) · Mathematics of Computation · doi:10.2307/2007938 · Cited by 4,845
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
Kemeny, J. G., & Snell, J. L. (1976) · Medical Entomology and Zoology · Cited by 2,813
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Baxter, L. A. (1995) · Technometrics · doi:10.1080/00401706.1995.10484354 · Cited by 2,415
Introduction to the Numerical Solution of Markov Chains
Stewart, W. J. (1995) · Princeton University Press eBooks · doi:10.1515/9780691223384 · Cited by 1,750
Bush, K. A., Kemeny, J. G., & Snell, J. L. (1960) · The American Mathematical Monthly · doi:10.2307/2309264 · Cited by 1,546
Nineteen Dubious Ways to Compute the Exponential of a Matrix
Moler, C., & Van Loan, C. (1978) · SIAM Review · doi:10.1137/1020098 · Cited by 1,526
A logic for reasoning about time and reliability
Hansson, H., & Jonsson, B. (1994) · Formal Aspects of Computing · doi:10.1007/bf01211866 · Cited by 1,372
Numerical Recipes in C: The Art of Scientific Computing
Seiler, M. C., & Seiler, F. A. (1989) · Risk Analysis · doi:10.1111/j.1539-6924.1989.tb01007.x · Cited by 1,346
Specification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
Bisimulation through probabilistic testing
Larsen, K. G., & Skou, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90030-6 · Cited by 1,206
�ber die analytischen Methoden in der Wahrscheinlichkeitsrechnung
Kolmogoroff, A. (1931) · Mathematische Annalen · doi:10.1007/bf01457949 · Cited by 1,064
Iosifescu, M., & Howard, R. A. (1972) · International Statistical Review · doi:10.2307/1402771 · Cited by 897
Modeling and Analysis of Stochastic Systems
Kulkarni, V. G. (2009) · Chapman & Hall/CRC eBooks · doi:10.1201/b12749 · Cited by 759
NUSMV: a new symbolic model checker
Cimatti, A., Clarke, E. M., Giunchiglia, F., et al. (2000) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050046 · Cited by 726
Automatic verification of probabilistic concurrent finite state programs
Vardi, M. Y. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.12 · Cited by 680
Using branching time temporal logic to synthesize synchronization skeletons
Emerson, E. A., & Clarke, E. M. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(83)90017-5 · Cited by 660
SPNP: stochastic Petri net package
Ciardo, G., Muppala, J., & Trivedi, K. (2003) · Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 · doi:10.1109/pnpm.1989.68548 · Cited by 547
Modeling and Analysis of Stochastic Systems
Atkinson, J. B. (1996) · Journal of the Operational Research Society · doi:10.1057/jors.1996.159 · Cited by 492
Characterizing finite Kripke structures in propositional temporal logic
Browne, M. C., Clarke, E. M., & Grümberg, O. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90098-9 · Cited by 419
Model-checking continuous-time Markov chains
Aziz, A., Sanwal, K., Singhal, V., & Brayton, R. (2000) · ACM Transactions on Computational Logic · doi:10.1145/343369.343402 · Cited by 419
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
Fujita, M., McGeer, P. C., & Yang, J. C.-Y. (1997) · Formal Methods in System Design · doi:10.1023/a:1008647823331 · Cited by 409
Model checking of probabilistic and nondeterministic systems
Bianco, A., & Alfaro, L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60692-0_70 · Cited by 408
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
Younes, H. L. S., & Simmons, R. G. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45657-0_17 · Cited by 373
Automatic verification of real-time systems with discrete probability distributions
Kwiatkowska, M., Norman, G., Segala, R., & Sproston, J. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00046-9 · Cited by 333
Numerical transient analysis of markov models
Reibman, A., & Trivedi, K. S. (1988) · Computers & Operations Research · doi:10.1016/0305-0548(88)90026-3 · Cited by 313
Stochastic Activity Networks: Structure, Behavior, and Application
Meyer, J. F., Movaghar, A., & Sanders, W. H. (1985) · Cited by 225
It usually works: The temporal logic of stochastic systems
Aziz, A., Singhal, V., Balarin, F., Brayton, R. K., & Sangiovanni-Vincentelli, A. L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60045-0_48 · Cited by 222
The Murphi Verification System
Dill, D. L. (1996) · Computer Aided Verification · Cited by 190
Model-checking for probabilistic real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54233-7_128 · Cited by 177
Model Checking Continuous-Time Markov Chains by Transient Analysis
Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722167_28 · Cited by 167
Self-citationApproximative Symbolic Model Checking of Continuous-Time Markov Chains
Christel Baier, A., Katoen, J.-P., & Hermanns, H. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48320-9_12 · Cited by 130
Self-citationVerifying temporal properties of finite-state probabilistic programs
Courcoubetis, C., & Yannakakis, M. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21950 · Cited by 126
On the Logical Characterisation of Performability Properties
Christel Baier, A., Haverkort, B. R. H. M., Hermanns, H., & Katoen, J.-P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45022-x_65 · Cited by 120
Self-citationHermanns, H., Katoen, J.-P., Meyer-Kayser, J., & Siegle, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46419-0_24 · Cited by 105
Self-citationHow to specify and verify the long-run average behaviour of probabilistic systems
de Alfaro, L. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1998.705679 · Cited by 89
A tool for model-checking Markov chains
Katoen, J.-P., Meyer-Kayser, J., Siegle, M., & Hermanns, H. (2003) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090100072 · Cited by 89
Self-citationFaster and Symbolic CTMC Model Checking
Katoen, J.-P., Kwiatkowska, M., Norman, G., & Parker, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44804-7_2 · Cited by 80
Self-citationModeling and analysis of communication systems based on computational methods for Markov chains
Krieger, U. R., Müller‐Clostermann, B., & Sczittnick, M. (1990) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.62851 · Cited by 73
Model-checking large structured Markov chains
Buchholz, P., Katoen, J.-P., Kemper, P. F., & Tepper, C. (2003) · The Journal of Logic and Algebraic Programming · doi:10.1016/s1567-8326(02)00067-x · Cited by 54
Self-citationOn the verification of qualitative properties of probabilistic processes under fairness constraints
Christel Baier, A., & Kwiatkowska, M. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(98)00038-6 · Cited by 40
Cited by
Kwiatkowska, M., Norman, G., & Parker, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72522-0_6 · Cited by 590
Statistical Model Checking: An Overview
Legay, A., Delahaye, B., & Bensalem, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16612-9_11 · Cited by 421
A Storm is Coming: A Modern Probabilistic Model Checker
Dehnert, C., Junges, S., Katoen, J.-P., & Volk, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63390-9_31 · Cited by 401
Self-citationA Survey of Statistical Model Checking
Agha, G., & Palmskog, K. (2018) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/3158668 · Cited by 285
PRISM: probabilistic model checking for performance and reliability analysis
Kwiatkowska, M., Norman, G., & Parker, D. (2009) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1530873.1530882 · Cited by 252
Metadata
- Authors
- Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2003-06
- Volume
- 29
- Issue
- 6
- Pages
- 524-541
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2141881497
- Cited by
- 767
- References
- 50
- FWCI
- 25.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.