Model Checking with Finite Complete Prefixes Is PSPACE-Complete.
Keijo HeljankoPublished in: CONCUR (2000)
Keyphrases
- pspace complete
- model checking
- temporal logic
- np complete
- formal verification
- linear temporal logic
- finite state
- model checker
- decision problems
- computation tree logic
- verification method
- formal specification
- satisfiability problem
- formal methods
- finite automata
- epistemic logic
- bounded model checking
- np hard
- coalition logic