On the complexity of the model checking problem
Florent R. MadelaineBarnaby MartinPublished in: CoRR (2012)
Keyphrases
- model checking
- pspace complete
- temporal logic
- formal verification
- formal specification
- model checker
- temporal properties
- finite state
- partial order reduction
- automated verification
- epistemic logic
- symbolic model checking
- verification method
- finite state machines
- bounded model checking
- computation tree logic
- transition systems
- formal methods
- reactive systems
- reachability analysis
- process algebra
- timed automata
- linear temporal logic
- concurrent systems
- satisfiability problem
- specification language
- computational complexity
- planning domains
- decision problems