The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Model-checking continuous-time Markov chains
Abstract
We present a logical formalism for expressing properties of continuous-time Markov chains. The semantics for such properties arise as a natural extension of previous work on discrete-time Markov chains to continuous time. The major result is that the verification problem is decidable; this is shown using results in algebraic and transcendental number theory.
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
Kailath, T. (1980) · Cited by 6,215
Ross, S. M. (1982) · Cited by 3,812
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
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
Model-checking for real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (2002) · [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1990.113766 · Cited by 897
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
Verifying 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
Cited by
Model-checking algorithms for continuous-time markov chains
Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1205180 · Cited by 767
Kwiatkowska, M., Norman, G., & Parker, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72522-0_6 · Cited by 590
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
A Survey of Statistical Model Checking
Agha, G., & Palmskog, K. (2018) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/3158668 · Cited by 285
Statistical 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
- Aziz, A., Sanwal, K., Singhal, V., & Brayton, R.
- Venue
- ACM Transactions on Computational Logic
- Published
- 2000-07
- Volume
- 1
- Issue
- 1
- Pages
- 162-170
- ISSN
- 1529-3785 (ISSN-L)
- 1557-945X
- OpenAlex
- W2041226400
- Cited by
- 419
- References
- 7
- FWCI
- 5.85
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Model-checking continuous-time Markov chains. https://app.cochat.ai/papers/10.1145/343369.343402
- The paper
- Aziz, A., Sanwal, K., Singhal, V., & Brayton, R. (2000). Model-checking continuous-time Markov chains. ACM Transactions on Computational Logic. https://doi.org/10.1145/343369.343402
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.