Automatic invariant checking for discrete block diagrams using Lyapunov functions with sat modulo theory solvers.
Christian DernehlPublished in: ECC (2016)
Keyphrases
- sat solvers
- modulo theories
- sat solving
- satisfiability modulo theories
- control theory
- boolean variables
- boolean satisfiability
- translation invariant
- search algorithm
- sat instances
- constraint satisfaction
- sat problem
- clause learning
- search problems
- continuous functions
- propositional satisfiability
- satisfiability problem
- affine transformation
- backtracking search
- orders of magnitude
- logic programming