Efficient Model Checking Timed and Weighted Interpreted Systems Using SMT and SAT Solvers.
Agnieszka M. ZbrzeznyAndrzej ZbrzeznyFranco RaimondiPublished in: KES-AMSTA (2016)
Keyphrases
- model checking
- timed automata
- finite state machines
- sat solvers
- automated verification
- temporal logic
- formal methods
- partial order reduction
- verification method
- formal specification
- formal verification
- reactive systems
- asynchronous circuits
- model checker
- symbolic model checking
- petri net
- computation tree logic
- epistemic logic
- propositional satisfiability
- domain independent
- bounded model checking
- knowledge base
- max sat
- search tree
- orders of magnitude