Improvements in SAT-based Reachability Analysis for Timed Automata.
Andrzej ZbrzeznyPublished in: Fundam. Informaticae (2004)
Keyphrases
- reachability analysis
- timed automata
- model checking
- bounded model checking
- theorem prover
- markov decision processes
- first order logic
- theorem proving
- planning domains
- temporal logic
- real time systems
- answer set programming
- sat solvers
- ai planning
- formal verification
- machine learning
- reinforcement learning
- planning problems
- version space
- boolean satisfiability
- incremental algorithms
- low cost
- dynamic programming