Graded-CTL: Satisfiability and Symbolic Model Checking.
Alessandro FerranteMargherita NapoliMimmo ParentePublished in: ICFEM (2009)
Keyphrases
- symbolic model checking
- model checking
- alternating time temporal logic
- bounded model checking
- temporal logic
- satisfiability problem
- formal verification
- computation tree logic
- model checker
- conformant planning
- partial observability
- formal specification
- symbolic representation
- finite state
- computational complexity
- binary decision diagrams
- np complete
- linear temporal logic
- phase transition
- heuristic search