An NP-complete fragment of LTL.
Anca MuschollIgor WalukiewiczPublished in: Int. J. Found. Comput. Sci. (2005)
Keyphrases
- np complete
- model checking
- np hard
- temporal logic
- randomly generated
- satisfiability problem
- linear temporal logic
- deterministic automata
- computational complexity
- bounded model checking
- linear time temporal logic
- constraint satisfaction problems
- phase transition
- data complexity
- np complete problems
- polynomial time complexity
- domain specific
- state space
- finite automata
- transition systems