The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
PRISM: Probabilistic Symbolic Model Checker
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
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
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
Alur, R., & Henzinger, T. A. (1999) · Formal Methods in System Design · doi:10.1023/a:1008739929481 · Cited by 541
Probabilistic symbolic model checking with PRISM: a hybrid approach
Kwiatkowska, M., Norman, G., & Parker, D. (2004) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-004-0140-2 · Cited by 435
Self-citationMulti-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
Cachin, C., Kursawe, K., & Shoup, V. (2000) · Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing · doi:10.1145/343477.343531 · Cited by 170
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-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
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-citationVerification of multiprocess probabilistic protocols
Pnueli, A., & Zuck, L. D. (1986) · Distributed Computing · doi:10.1007/bf01843570 · Cited by 123
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
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
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
Kwiatkowska, M., Norman, G., & Parker, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46002-0_5 · Cited by 101
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
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-citation
Cited by
Probabilistic symbolic model checking with PRISM: a hybrid approach
Kwiatkowska, M., Norman, G., & Parker, D. (2004) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-004-0140-2 · Cited by 435
Self-citationStatistical Model Checking of Black-Box Probabilistic Systems
Sen, K., Viswanathan, M., & Agha, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27813-9_16 · Cited by 281
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
“Table 4 Main technologies excluded from the survey, along with the motivation spanning between (i) “general purpose”, (ii) “no logic”, (iii) “technology not found” Motivation for exclusion Technology General purpose 4QL [243], CCALC [163], CDF-Rules [164], Clingo [292], DR-Prolog [37], Inter4QL [199], InterProlog [62]…”
BackgroundTowards formal verification of IoT protocols: A Review
Hofer-Schmitz, K., & Stojanović, B. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107233 · Cited by 104
Practical verification of decision-making in agent-based autonomous systems
Dennis, L. A., Fisher, M., Lincoln, N. K., Lisitsa, A., & Veres, S. M. (2016) · Automated Software Engineering · doi:10.1007/s10515-014-0168-9 · Cited by 102
Metadata
- Authors
- Kwiatkowska, M., Norman, G., & Parker, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 200-204
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2134991157
- Cited by
- 693
- References
- 18
- FWCI
- 28.08
- Type
- conference paper
- 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.