Symbolic Reachability Analysis Based on SAT-Solvers.
Parosh Aziz AbdullaPer BjesseNiklas EénPublished in: TACAS (2000)
Keyphrases
- sat solvers
- reachability analysis
- markov decision processes
- model checking
- orders of magnitude
- search space
- timed automata
- constraint satisfaction
- search strategies
- sat solving
- state space
- incremental algorithms
- propositional satisfiability
- boolean satisfiability
- sat instances
- sat problem
- max sat
- clause learning sat solvers
- sat encodings
- weighted max sat
- constraint satisfaction problems
- clause learning
- binary decision diagrams
- markov decision process
- search strategy
- linear programming
- dynamic programming