On the expressivity and complexity of quantitative branching-time temporal logics.
François LaroussiniePhilippe SchnoebelenMathieu TuruaniPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- temporal logic
- model checking
- modal logic
- satisfiability problem
- concurrent systems
- mazurkiewicz traces
- worst case
- computation tree logic
- belief revision
- verification method
- predicate logic
- linear temporal logic
- model checker
- qualitative and quantitative
- temporal knowledge
- computational complexity
- transition systems
- bounded model checking
- np hard
- special case