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
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.