CTL May Be Ambiguous When Model Checking Moore Machines.
Cédric RouxEmmanuelle EncrenazPublished in: CHARME (2003)
Keyphrases
- model checking
- temporal logic
- computation tree logic
- temporal properties
- formal verification
- finite state
- automated verification
- model checker
- formal specification
- transition systems
- pspace complete
- bounded model checking
- verification method
- symbolic model checking
- reachability analysis
- finite state machines
- formal methods
- concurrent systems
- asynchronous circuits
- timed automata
- process algebra
- epistemic logic
- np complete
- satisfiability problem
- planning problems
- temporal epistemic