The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
“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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Prior, A. (1967) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780198243113.001.0001 · Cited by 1,484
Propositional dynamic logic of regular programs
Fischer, M. J., & Ladner, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90046-1 · Cited by 1,193
The complexity of propositional linear temporal logics
Sistla, A. P., & Clarke, E. M. (1985) · Journal of the ACM · doi:10.1145/3828.3837 · Cited by 1,095
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
Self-citationOn the temporal analysis of fairness
Gabbay, D. M., Pnueli, A., Shelah, S., & Stavi, J. (1980) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567446.567462 · Cited by 732
The temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Prior, A. N. (1957) · Cited by 670
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
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
Self-citationEMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Self-citationOn the synthesis of a reactive module
Pnueli, A., & Rosner, R. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75293 · Cited by 1,432
Alternating-time temporal logic
Alur, R., Henzinger, T. A., & Kupferman, O. (2002) · Journal of the ACM · doi:10.1145/585265.585270 · Cited by 1,394
Agent theories, architectures, and languages: A survey
Wooldridge, M., & Jennings, N. R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-58855-8_1 · Cited by 1,363
Agent-based software engineering
Wooldridge, M. (1997) · IEE Proceedings - Software Engineering · doi:10.1049/ip-sen:19971026 · Cited by 803
Automatic verification of probabilistic concurrent finite state programs
Vardi, M. Y. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.12 · Cited by 680
An automata-theoretic approach to linear temporal logic
Vardi, M. Y. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60915-6_6 · Cited by 660
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
Differential Dynamic Logic for Hybrid Systems
Platzer, A. (2008) · Journal of Automated Reasoning · doi:10.1007/s10817-008-9103-8 · Cited by 390
A formal specification of dMARS
d'Inverno, M., Kinny, D., Luck, M., & Wooldridge, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026757 · Cited by 327
Formal verification in hardware design: a survey
Kern, C., & Greenstreet, M. R. (1999) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/307988.307989 · Cited by 284
Temporal Logics for Hyperproperties
Clarkson, M. R., Finkbeiner, B., Koleini, M., Micinski, K. K., Rabe, M. N., & Sánchez, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54792-8_15 · Cited by 270
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
- 21
- 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
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.