“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)
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
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
Model checking
Temporal Logic with Reference Pointers
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
An n! lower bound on formula size
ACM Transactions on Computational Logic (TOCL)
On the Expressive Power of CTL
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st 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
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
25 Years of Model Checking: History, Achievements, Perspectives
25 Years of Model Checking: History, Achievements, Perspectives
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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 hybrid logics with binders
CSL'05 Proceedings of the 19th international 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
Expressiveness of Hybrid Temporal Logic on Data Words
Electronic Notes in Theoretical Computer Science (ENTCS)
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
While classical temporal logics lose track of a state as soon as a temporal operator is applied, several branching-time logics able to repeatedly refer to a state have been introduced in the literature. We study such logics by introducing a new formalism, hybrid branching-time logics, subsuming the other approaches and making the ability to refer to a state more explicit by assigning a name to it. We analyze the expressive power of hybrid branching-time logics and the complexity of their satisfiability problem. As main result, the satisfiability problem for the hybrid versions of several branching-time logics is proved to be 2EXPTIME-complete. To prove the upper bound, the automata-theoretic approach to branching-time logics is extended to hybrid logics. As a result of independent interest, the nonemptiness problem for alternating one-pebble Büchi tree automata is shown to be 2EXPTIME-complete. A common property of the logics studied is that they refer to only one state. This restriction is crucial: The ability to refer to more than one state causes a nonelementary blow-up in complexity. In particular, we prove that satisfiability for NCTL* has nonelementary complexity.