Efficient model-checking of weighted CTL with upper-bound constraints.
Jonas Finnemann JensenKim Guldstrand LarsenJirí SrbaLars Kaerlund OestergaardPublished in: Int. J. Softw. Tools Technol. Transf. (2016)
Keyphrases
- model checking
- temporal logic
- upper bound
- formal verification
- temporal properties
- model checker
- computation tree logic
- finite state machines
- formal specification
- finite state
- symbolic model checking
- verification method
- automated verification
- epistemic logic
- bounded model checking
- transition systems
- lower bound
- pspace complete
- linear temporal logic
- reachability analysis
- concurrent systems
- timed automata
- process algebra
- alternating time temporal logic
- asynchronous circuits
- formal methods
- modal logic
- multi agent systems