The complexity of propositional linear temporal logics

Authors:
A. P. Sistla;E. M. Clarke
Affiliations:
-;-
Venue:
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Year:
1982

Citing 3
Cited 12

On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Modalities for model checking (extended abstract): branching time strikes back

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On characterization of safety and liveness properties in temporal logic

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The logic of distributed protocols: preliminary report

TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
From Church and Prior to PSL

25 Years of Model Checking
From Philosophical to Industrial Logics

ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
From monadic logic to PSL

Pillars of computer science
Complexity of reasoning over temporal data models

ER'10 Proceedings of the 29th international conference on Conceptual modeling
Two variable vs. linear temporal logic in model checking and games

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the complexity of satisfiability and determination of truth in a particular finite structure for different propositional linear temporal logics. We show that both the above problems are NP-complete for the logic with F operator and are PSPACE-complete for the logics with F,X, with U, with U,S,X, and Wolper's extended logic with regular operators [Wo81].