SAT-based Reachability Checking for Timed Automata with Diagonal Constraints.
Andrzej ZbrzeznyPublished in: Fundam. Informaticae (2005)
Keyphrases
- timed automata
- constraint solver
- model checking
- constraint checking
- constrained optimization
- consistency checking
- reachability analysis
- covariance matrix
- active learning
- constraint satisfaction
- bounded model checking
- sat encodings
- constraint networks
- constraint logic programming
- constraint solving
- real time systems
- real time
- constraint propagation
- answer set programming
- sat solvers
- temporal logic
- machine learning