The DOI matches its Crossref record.
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Open accessAbstract
The differences between and appropriateness of branching versus linear time temporal logic for reasoning about concurrent programs are studied. These issues have been previously considered by Lamport. To facilitate a careful examination of these issues, a language, CTL * , in which a universal or existential path quantifier can prefix an arbitrary linear time assertion, is defined. The expressive power of a number of sublanguages is then compared. CTL* is also related to the logics MPL of Abrahamson and PL of Harel, Kozen, and Parikh. The paper concludes with a comparison of the utility of branching and linear time temporal logics.
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
Cited by
Intelligent agents: theory and practice
Wooldridge, M., & Jennings, N. R. (1995) · The Knowledge Engineering Review · doi:10.1017/s0269888900008122 · Cited by 6,810
Agent-based software engineering
Wooldridge, M. (1997) · IEE Proceedings - Software Engineering · doi:10.1049/ip-sen:19971026 · Cited by 803
Characterizing finite Kripke structures in propositional temporal logic
Browne, M. C., Clarke, E. M., & Grümberg, O. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90098-9 · Cited by 419
Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications
van der Hoek, W., & Wooldridge, M. (2003) · Studia Logica · doi:10.1023/a:1026185103185 · Cited by 269
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
Self-citation
Metadata
- Authors
- Emerson, E. A., & Halpern, J. Y.
- Venue
- Journal of the ACM
- Published
- 1986-01-02
- Volume
- 33
- Issue
- 1
- Pages
- 151-178
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2004306067
- Cited by
- 1,009
- References
- 0
- FWCI
- 11.42
- Type
- journal article
- Language
- en
- Open access
- bronze
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: “Sometimes” and “not never” revisited: on branching versus linear time temporal logic. https://app.cochat.ai/papers/10.1145/4904.4999
- The paper
- Emerson, E. A., & Halpern, J. Y. (1986). “Sometimes” and “not never” revisited: on branching versus linear time temporal logic. Journal of the ACM. https://doi.org/10.1145/4904.4999
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.
