Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Journal of Computer and System Sciences
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A hierarchy of temporal logics with past
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
"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
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Memoryful Branching-Time Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
CTL+ is complete for double exponential time
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
| Hi-index | 0.00 |
We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, past modalities, and forgettable past. Our main result shows that satisfiability for CTL with all these extensions is still in 2EXPTIME, which strongly contrasts with the nonelementary complexity of CTL* with forgettable past. We give a complete classification of combinations of these extensions, yielding a dichotomy between extensions with 2EXPTIME-complete and those with EXPTIME-complete complexity. In particular, we show that satisfiability for the extension of UB with forgettable past is complete for 2EXPTIME, contradicting a claim for a stronger logic in the literature. The upper bounds are established with the help of a new kind of pebble automata.