Local Model Checking of Weighted CTL with Upper-Bound Constraints.
Jonas Finnemann JensenKim Guldstrand LarsenJirí SrbaLars Kaerlund OestergaardPublished in: SPIN (2013)
Keyphrases
- model checking
- upper bound
- temporal logic
- computation tree logic
- temporal properties
- lower bound
- bounded model checking
- finite state
- automated verification
- reachability analysis
- symbolic model checking
- formal verification
- formal specification
- pspace complete
- model checker
- process algebra
- epistemic logic
- verification method
- formal methods
- concurrent systems
- timed automata
- alternating time temporal logic
- worst case
- asynchronous circuits
- planning domains
- constraint programming
- np complete
- abstract interpretation
- deterministic finite automaton