1 research outputs found
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem
We present an almost complete classification of the parameterized complexity
of all operator fragments of the satisfiability problem in computation tree
logic CTL. The investigated parameterization is the sum of temporal depth and
structural pathwidth. The classification shows a dichotomy between W[1]-hard
and fixed-parameter tractable fragments. The only real operator fragment which
is confirmed to be in FPT is the fragment containing solely AX. Also we prove a
generalization of Courcelle's theorem to infinite signatures which will be used
to proof the FPT-membership case.Comment: Conference version: "L\"uck, Meier, Schindler. Parameterized
Complexity of CTL: A Generalization of Courcelle's Theorem. Language and
Automata Theory and Applications - 9th International Conference, LATA 2015,
Nice, France. Lecture Notes in Computer Science, Volume 8977, pp. 549-560,
Springer