Paper Info
Title
On the expressive power of hybrid branching-time logics
Abstract
Hybrid branching-time logics are a powerful extension of branching-time logics like CTL, CTL⁎ or even the modal μ-calculus through the addition of binders, jumps and variable tests. Their expressiveness is not restricted by bisimulation-invariance anymore. Hence, they do not retain the tree model property, and the finite model property is equally lost. Their satisfiability problems are typically undecidable, their model checking problems (on finite models) are decidable with complexities ranging from polynomial to non-elementary time.
Year
DOI
Venue
2018
10.1016/j.tcs.2020.01.014
Theoretical Computer Science
Keywords
Field
DocType
Branching-time logics,Hybrid logics,Expressive power
Computer science,Theoretical computer science,Expressive power,Branching (version control)
Conference
Volume
ISSN
Citations 
813
0304-3975
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Daniel Kernberger100.34
Martin Lange244722.83