Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Handbook of theoretical computer science (vol. B)
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
On the complexity of unique solutions
Journal of the ACM (JACM)
Model checking
Symbolic Model Checking
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
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
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Logic for Reasoning about Rational Agents
Computational Logic in Multi-Agent Systems
Verifying agents with memory is harder than it seemed
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Among the branching-time temporal logics used for the specification and verification of systems, CTL+, FCTL and ECTL+ are the most notable logics for which the precise computational complexity of model checking is not known. We answer this longstanding open problem and show that model checking these (and some related) logics is Δ2p-complete.