Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Given a switched multi–inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function relat...
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
Andreas Eggers, Natalia Kalinnik, Stefan Kupfersch...
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...