The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Symbolic model checking for probabilistic processes
Open accessAbstract
We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics typically involves solving linear equation systems in order to ascertain the probability of a given formula holding in a state. Our algorithm is based on the idea of representing the matrices used in the linear equation systems by Multi-Terminal Binary Decision Diagrams (MTBDDs) introduced in Clarke et al [14]. Our procedure, based on the algorithm used by Hansson and Jonsson [24], uses BDDs to represent formulas and MTBDDs to represent Markov chains, and is efficient because it avoids explicit state space construction. A PCTL model checker is being implemented in Verus [9].
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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-citationProbabilistic 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
Metadata
- Authors
- Baier, C., Clarke, E. M., Hartonas-Garmhausen, V., Kwiatkowska, M., & Ryan, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Pages
- 430-440
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1806449990
- Cited by
- 162
- References
- 1
- FWCI
- 8.83
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Symbolic model checking for probabilistic processes. https://app.cochat.ai/papers/10.1007/3-540-63165-8_199
- The paper
- Baier, C., Clarke, E. M., Hartonas-Garmhausen, V., Kwiatkowska, M., & Ryan, M. (1997). Symbolic model checking for probabilistic processes. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-63165-8_199
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.