Abstract
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. © 1985, ACM. All rights reserved.
Cite
CITATION STYLE
APA
Sistla, A. P., & Clarke, E. M. (1985). The Complexity of Propositional Linear Temporal Logics. Journal of the ACM (JACM), 32(3), 733–749. https://doi.org/10.1145/3828.3837
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free