Advanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling.
Florian PigorschChristoph SchollStefan DischPublished in: MBMV (2006)
Keyphrases
- model checking
- temporal logic
- binary decision diagrams
- computation tree logic
- temporal properties
- formal verification
- bounded model checking
- automated verification
- model checker
- symbolic model checking
- formal specification
- finite state
- timed automata
- process algebra
- verification method
- formal methods
- transition systems
- linear temporal logic
- reachability analysis
- concurrent systems
- pspace complete
- epistemic logic
- boolean functions
- asynchronous circuits
- reactive systems
- multi agent systems
- planning domains
- rough sets