On the Complexity of the Model Checking Problem.
Florent R. MadelaineBarnaby MartinPublished in: SIAM J. Comput. (2018)
Keyphrases
- model checking
- pspace complete
- temporal logic
- temporal properties
- model checker
- reachability analysis
- symbolic model checking
- automated verification
- finite state
- partial order reduction
- formal verification
- transition systems
- np complete
- computation tree logic
- formal specification
- finite state machines
- linear temporal logic
- bounded model checking
- verification method
- concurrent systems
- timed automata
- epistemic logic
- deterministic finite automaton
- formal methods
- process algebra
- alternating time temporal logic
- asynchronous circuits