Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 419

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

Aziz, Adnan, Sanwal, Kumud, Singhal, Vigyan, Brayton, Robert·2000·ACM Transactions on Computational Logic

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/343369.343402

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 7 references

Cited by

See all 419

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.