Parametrised Complexity of Satisfiability in Temporal Logic.
Martin LückArne MeierIrena SchindlerPublished in: ACM Trans. Comput. Log. (2017)
Keyphrases
- temporal logic
- satisfiability problem
- model checking
- automata theoretic
- modal logic
- computational complexity
- bounded model checking
- concurrent systems
- linear temporal logic
- verification method
- computation tree logic
- decision procedures
- model checker
- np complete
- belief revision
- temporally extended
- formal verification
- propositional logic
- mazurkiewicz traces
- decision problems