The Complexity of Satisfiability for Fragments of CTL and CTL*.
Arne MeierMichael ThomasHeribert VollmerMartin MundhenkPublished in: Int. J. Found. Comput. Sci. (2009)
Keyphrases
- bounded model checking
- temporal logic
- model checking
- satisfiability problem
- computation tree logic
- temporal properties
- computational complexity
- linear temporal logic
- minimal change
- formal verification
- epistemic logic
- qualitative preferences
- computational cost
- alternating time temporal logic
- neural network
- formal specification
- space complexity
- transition systems
- decision problems
- worst case