The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Information Processing Letters
The complexity of concept languages
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Automata based symbolic reasoning in hardware verification
Formal Methods in System Design
The logic of “initially” and “next”: complete axiomatization and complexity
Information Processing Letters
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
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
Another Look at LTL Model Checking
Formal Methods in System Design
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Relating linear and branching model checking
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A Simple Tableau System for the Logic of Elsewhere
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the expressivity and complexity of quantitative branching-time temporal logics
Theoretical Computer Science - Latin American theoretical informatics
Theoretical Computer Science
Information Processing Letters
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
BTL2 and the expressive power of ECTL+
Information and Computation
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Complexity and Succinctness Issues for Linear-Time Hybrid Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
LTL Path Checking Is Efficiently Parallelizable
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Complexity and succinctness issues for linear-time hybrid logics
Theoretical Computer Science
Information Processing Letters
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
ACM Transactions on Computational Logic (TOCL)
Weak Kripke structures and LTL
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
An NP-Complete fragment of LTL
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the complexity of LTL model-checking of recursive state machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
It is well known that model checking and satisfiability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model checkers are successfully used in practice. In this article we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the number of atomic propositions, and (3) the temporal height. 2002 Elsevier Science (USA).