Name
Abstract | ||
|---|---|---|
We consider hybridisations of the full branching time logic CTL⁎ and its prominent fragments CTL, CTL+ and FCTL+ through the addition of nominals, binders and jumps. We formally define three types of hybridisations by restricting the interplay between hybrid operators and path formulas contrary to previous proposals in the literature which ignored potential problems with a formal semantics. We then investigate the model checking problem for these logics obtaining expression complexities from PSpace -completeness to non-elementary decidability and data complexities ranging from NLogSpace to PSpace. Lastly, we identify a family of fragments of these hybrid logics, called the bounded fragments, that (in some cases) have the same model checking complexity as their non-hybrid counterparts. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.jlamp.2018.11.007 | Journal of Logical and Algebraic Methods in Programming |
Keywords | Field | DocType |
Hybrid logics,Model checking | Discrete mathematics,Model checking,Decidability,PSPACE,Operator (computer programming),CTL*,Completeness (statistics),Mathematics,Branching (version control),Bounded function | Journal |
Volume | ISSN | Citations |
110 | 2352-2208 | 0 |
PageRank | References | Authors |
0.34 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Kernberger | 1 | 0 | 0.34 |
| Martin Lange | 2 | 447 | 22.83 |