Symbolic CTL Model Checking for Incomplete Designs by Selecting Property-Specific Subsets of Local Component Assumptions.
Christian MillerTobias NopperChristoph SchollPublished in: MBMV (2009)
Keyphrases
- model checking
- temporal logic
- computation tree logic
- temporal properties
- automated verification
- formal verification
- bounded model checking
- formal specification
- finite state
- model checker
- concurrent systems
- transition systems
- epistemic logic
- formal methods
- process algebra
- reachability analysis
- timed automata
- temporal epistemic
- symbolic model checking
- finite state machines
- pspace complete
- modal logic
- reactive systems
- binary decision diagrams
- deterministic finite automaton
- description logics
- asynchronous circuits