The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The complexity of propositional linear temporal logics
Open accessAbstract
The complexity of satisfiability and determination of truth in a particular finite structure are considered for different propositional linear temporal logics. It is shown that these problems are NP-complete for the logic with F and are PSPACE-complete for the logics with F, X, with U, with U, S, X operators and for the extended logic with regular operators given by Wolper.
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
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
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Self-citationRelationships between nondeterministic and deterministic tape complexities
Savitch, W. J. (1970) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(70)80006-x · Cited by 1,366
The Computational Complexity of Provability in Systems of Modal Propositional Logic
Ladner, R. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206033 · Cited by 555
On the size of refutation Kripke models for some linear modal and tense logics
Ono, H., & Nakamura, A. (1980) · Studia Logica · doi:10.1007/bf00713542 · Cited by 62
The propositional dynamic logic of deterministic, well-structured programs
Halpern, J. Y., & Reif, J. H. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(83)90097-x · Cited by 62
Cited by
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
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49059-0_14 · Cited by 2,150
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
Model checking and abstraction
Clarke, E. M., Grumberg, O., & Long, D. E. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186051 · Cited by 1,211
Self-citation“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., & Zhu, Y. (2003) · Advances in Computers · doi:10.1016/s0065-2458(03)58003-2 · Cited by 952
Self-citationBelief, awareness, and limited reasoning
Fagin, R., & Halpern, J. Y. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90003-8 · Cited by 885
A brief account of runtime verification
Leucker, M., & Schallhart, C. (2009) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2008.08.004 · Cited by 863
Agent-based software engineering
Wooldridge, M. (1997) · IEE Proceedings - Software Engineering · doi:10.1049/ip-sen:19971026 · Cited by 803
Simple On-the-fly Automatic Verification of Linear Temporal Logic
Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1996) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-34892-6_1 · Cited by 705
The benefits of relaxing punctuality
Alur, R., Feder, T., & Henzinger, T. A. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112613 · Cited by 679
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
Model Checking of Safety Properties
Kupferman, O., & Vardi, M. Y. (2001) · Formal Methods in System Design · doi:10.1023/a:1011254632723 · Cited by 566
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clark, E., & Zhu, Y. (1999) · doi:10.21236/ada360973 · Cited by 537
Privacy and contextual integrity: framework and applications
Barth, A., Datta, A., Mitchell, J. C., & Nissenbaum, H. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.32 · Cited by 451
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
Self-citationOn the Decision Problem for Two-Variable First-Order Logic
Grädel, E., Kolaitis, P. G., & Vardi, M. Y. (1997) · Bulletin of Symbolic Logic · doi:10.2307/421196 · Cited by 321
Approximate Probabilistic Model Checking
Hérault, T., Lassaigne, R., Magniette, F., & Peyronnet, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24622-0_8 · Cited by 295
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
A general approach to network configuration verification
Beckett, R., Gupta, A., Mahajan, R., & Walker, D. (2017) · Proceedings of the Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3098822.3098834 · Cited by 262
Introduction to Process Algebra
Fokkink, W. (2000) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/978-3-662-04293-9 · Cited by 254
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
Metadata
- Authors
- Sistla, A. P., & Clarke, E. M.
- Venue
- Journal of the ACM
- Published
- 1985-07
- Volume
- 32
- Issue
- 3
- Pages
- 733-749
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2003227046
- Cited by
- 1,095
- References
- 6
- FWCI
- 9.81
- 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.