• DocumentCode
    3722903
  • Title

    LTL Fragments are Hard for Standard Parameterisations

  • Author

    L?ck;Arne Meier

  • Author_Institution
    Inst. fur Theor. Inf., Leibniz Univ. Hannover, Hannover, Germany
  • fYear
    2015
  • Firstpage
    59
  • Lastpage
    68
  • Abstract
    We classify the complexity of the LTL satisfiability and model checking problems for several standard parameterisations. The investigated parameters are temporal depth, number of propositional variables and formula treewidth, resp., pathwidth. We show that all operator fragments of LTL under the investigated parameterisations are intractable in the sense of parameterised complexity.
  • Keywords
    "Complexity theory","Model checking","Runtime","Turing machines","Standards","Context","Semantics"
  • Publisher
    ieee
  • Conference_Titel
    Temporal Representation and Reasoning (TIME), 2015 22nd International Symposium on
  • ISSN
    1530-1311
  • Type

    conf

  • DOI
    10.1109/TIME.2015.9
  • Filename
    7371925
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3722903