On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics.
Ian M. HodkinsonRoman KontchakovAgi KuruczFrank WolterMichael ZakharyaschevPublished in: TIME (2003)
Keyphrases
- mazurkiewicz traces
- temporal logic
- computational complexity
- computation tree logic
- satisfiability problem
- model checking
- automata theoretic
- first order logic
- np complete
- linear temporal logic
- modal logic
- special case
- transitive closure
- linear time temporal logic
- formal verification
- bit rate
- bounded model checking
- temporal resolution
- cellular automata
- temporal epistemic