Application of constraint solving and ODE-enclosure methods to the analysis of hybrid systems

In this short paper, we summarize our approach to analyzing hybrid discrete‐continuous systems by reduction to constraint solving paired with enclosure methods for sets of initial value problems of ordinary differential equations.

[1]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[2]  Daniel Gooch,et al.  Communications of the ACM , 2011, XRDS.

[3]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[4]  Nacim Meslem,et al.  Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization , 2008, HSCC.

[5]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[6]  Martin Fränzle,et al.  SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems , 2008, ATVA.

[7]  J. F. Groote,et al.  The safety guaranteeing system at station Hoorn-Kersenboogerd , 1994, COMPASS '95 Proceedings of the Tenth Annual Conference on Computer Assurance Systems Integrity, Software Safety and Process Security'.

[8]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[9]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.