Set-Membership Estimation of Hybrid Systems via SAT Modulo ODE*

SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems

SAT-Modulo-Theory based Analysis of Probabilistic Hybrid Systems

The framework of hybrid discrete-continuous systems becomes increasingly popular for modeling and verifying large real-world, often safety-critical, embedded systems, e.g. in the car and aviation industry. In contrast to purely discrete models, like Kripke structures, hybrid systems additionally show continuous behavior usually modeled by differential equations. Therefore, the state space of a ...

Answer Set Programming as SAT modulo Acyclicity

Answer set programming (ASP) is a declarative programming paradigm for solving search problems arising in knowledge-intensive domains. One viable way to implement the computation of answer sets corresponding to problem solutions is to recast a logic program as a Boolean satisfiability (SAT) problem and to use existing SAT solver technology for the actual search. Such mappings can be obtained by...

Secure Set Membership Using 3 Sat ∗ ( Extended

A wide variety of powerful cryptographic tools have been built using RSA, Diffie-Hellman, and other similar assumptions as their basis. Computational security has been achieved relative to complexity assumptions about the computational difficulty of a variety of number theoretic problems. However, these problems are closely related, and it is likely that if any one of them turns out to be effic...

Using hybrid automata for set-membership state estimation with uncertain nonlinear continuous-time systems

This paper deals with set membership state estimation for continuous-time systems from discrete-time measurements, in the unknown but bounded error framework. The classical predictor-corrector approach to state estimation uses interval Taylor methods for solving the prediction phase, which are known to have poor performance in presence of large model or input uncertainty. In this paper, we show...