The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Probabilistic symbolic model checking with PRISM: a hybrid approach
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
McMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
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
PRISM: Probabilistic Symbolic Model Checker
Kwiatkowska, M., Norman, G., & Parker, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46029-2_13 · Cited by 693
Self-citationAlur, R., & Henzinger, T. A. (1999) · Formal Methods in System Design · doi:10.1023/a:1008739929481 · Cited by 541
Algebraic Decision Diagrams and Their Applications
Bahar, R. I., Frohm, E. A., Gaona, C. M., Hachtel, G. D., Macii, E., Pardo, A., & Somenzi, F. (1993) · Cited by 540
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
Verifying continuous time Markov chains
Aziz, A., Sanwal, K., Singhal, V., & Brayton, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_75 · Cited by 344
Algebraic decision diagrams and their applications
Bahar, R. I., Frohm, E. A., Gaona, C. M., Hachtel, G. D., Macii, E., Pardo, A., & Somenzi, F. (2002) · International Conference on Computer Aided Design · doi:10.1109/iccad.1993.580054 · Cited by 343
The PEPA workbench: A tool to support a process algebra-based approach to performance modelling
Gilmore, S. T., & Hillston, J. E. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58021-2_20 · Cited by 271
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
Symbolic model checking for probabilistic processes
Baier, C., Clarke, E. M., Hartonas-Garmhausen, V., Kwiatkowska, M., & Ryan, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_199 · Cited by 162
Self-citationReachability Analysis of Probabilistic Systems by Successive Refinements
D’Argenio, P. R., Jeannet, B., Jensen, H. E., & Larsen, K. G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44804-7_3 · Cited by 155
Markovian analysis of large finite state machines
Hachtel, G. D., Macii, E., Pardo, A., & Somenzi, F. (1996) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.552081 · Cited by 138
Approximative 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
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
de Alfaro, L., Kwiatkowska, M., Norman, G., Parker, D., & Roberto Segala, C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46419-0_27 · Cited by 129
Self-citationComputing Minimum and Maximum Reachability Times in Probabilistic Systems
de Alfaro, L. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48320-9_7 · Cited by 118
Hermanns, 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
Kwiatkowska, M., Norman, G., & Sproston, J. (2003) · Formal Aspects of Computing · doi:10.1007/s001650300007 · Cited by 99
Self-citationThe complexity of the optimal variable ordering problems of shared binary decision diagrams
Tani, S., Hamaguchi, K., & Yajima, S. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57568-5_270 · Cited by 89
How 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
Faster 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-citationAutomated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?
Kwiatkowska, M., Norman, G., & Roberto Segala, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44585-4_17 · Cited by 73
Self-citationProbabilistic analysis of large finite state machines
Hachtel, G. D., Macii, E., Pardo, A., & Somenzi, F. (1994) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/196244.196374 · Cited by 69
On the Representation of Probabilities over Structured Domains
Bozga, M. D., & Maler, O. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48683-6_24 · Cited by 55
Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling
Kwiatkowska, M., & Mehmood, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45605-8_9 · Cited by 30
Self-citationSymbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and Simplex
Kwiatkowska, M., Norman, G., Parker, D., Segala, R., & Zamboni, M. A. (1999) · Cited by 23
Self-citation
Cited by
PRISM: Probabilistic Symbolic Model Checker
Kwiatkowska, M., Norman, G., & Parker, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46029-2_13 · Cited by 693
Self-citationKwiatkowska, M., Norman, G., & Parker, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72522-0_6 · Cited by 590
Self-citationDynamic QoS Management and Optimization in Service-Based Systems
Calinescu, R., Grunske, L., Kwiatkowska, M., Mirandola, R., & Tamburrelli, G. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.92 · Cited by 374
Self-citationApproximate Probabilistic Model Checking
Hérault, T., Lassaigne, R., Magniette, F., & Peyronnet, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24622-0_8 · Cited by 295
Reasoning about partial goal satisfaction for requirements and design engineering
Letier, E., & van Lamsweerde, A. (2004) · Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering · doi:10.1145/1029894.1029905 · Cited by 265
Metadata
- Authors
- Kwiatkowska, M., Norman, G., & Parker, D.
- Venue
- International Journal on Software Tools for Technology Transfer
- Published
- 2004-04-06
- Volume
- 6
- Issue
- 2
- Pages
- 128-142
- ISSN
- 1433-2779 (ISSN-L)
- 1433-2787
- OpenAlex
- W2162943184
- Cited by
- 435
- References
- 30
- FWCI
- 36.05
- 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.