Eric Goubault
ABSTRACT
Computing a tight inner approximation of the range of a function over some set is notoriously difficult, way beyond obtaining outer approximations. We propose here a new method to compute a tight inner approximation of the set of reachable states of non-linear dynamical systems on a bounded time interval. This approach involves affine forms and Kaucher arithmetic, plus a number of extra ingredients from set-based methods. An implementation of the method is discussed, and illustrated on representative numerical schemes, discrete-time and continuous-time dynamical systems.
- M. Althoff, O. Stursberg, and M. Buss. Reachability analysis of linear systems with uncertain parameters and inputs. In IEEE CDC, 2007.Google Scholar
Cross Ref
- J. Aubin and H. Frankowska. Set-Valued Analysis. Birkhäuser, Boston, 1990.Google Scholar
- O. Bouissou, A. Chapoutot, and A. Djoudi. Enclosing temporal evolution of dynamical systems using numerical methods. In NASA Formal Methods, 2013.Google ScholarCross Ref
- X. Chen, E. Ábrahám, and S. Sankaranarayanan. Taylor model flowpipe construction for non-linear hybrid systems. In RTSS, pages 183--192, 2012. Google ScholarDigital Library
- X. Chen, E. Ábrahám, and S. Sankaranarayanan. Flow*: An analyzer for non-linear hybrid systems. In CAV, pages 258--263, 2013. Google ScholarDigital Library
- J. L. D. Comba and J. Stolfi. Affine arithmetic and its applications to computer graphics. SIBGRAPI, 1993.Google Scholar
- T. Dang and R. Testylier. Hybridization domain construction using curvature estimation. In HSCC, pages 123--132, 2011. Google ScholarDigital Library
- L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann. Mpfr: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw, 33(2):13, 2007. Google ScholarDigital Library
- E. Gardeñes, M. Sainz, L. Jorba, R. Calm, R. Estela, H. Mielgo, and A. Trepat. Model intervals. Reliable Computing, 7(2):77--111, 2001.Google ScholarCross Ref
- K. Ghorbal, E. Goubault, and S. Putot. The zonotope abstract domain taylor1+. In CAV'09, volume 5643 of LNCS, pages 627--633. Springer, 2009. Google ScholarDigital Library
- K. Ghorbal, E. Goubault, and S. Putot. A logical product approach to zonotope intersection. In CAV'10, volume 6174 of LNCS, 2010. Google ScholarDigital Library
- A. Girard. Reachability of uncertain linear systems using zonotopes. In HSCC'05. Springer, 2005. Google ScholarDigital Library
- A. Girard, C. Le Guernic, and O. Maler. Efficient computation of reachable sets of linear time-invariant systems with inputs. In HSCC 2006, volume 3927 of LNCS, pages 257--271. Springer, 2006. Google ScholarDigital Library
- A. Goldsztejn, D. Daney, M. Rueher, and P. Taillibert. Modal intervals revisited: a mean-value extension to generalized intervals. In QCP'05, 2005.Google Scholar
- A. Goldsztejn, L. Jaulin, et al. Inner approximation of the range of vector-valued functions. Reliable Computing, 14:1--23, 2010.Google Scholar
- E. Goubault, M. Kieffer, O. Mullier, and S. Putot. General inner approximation of vector-valued functions. Reliable Computing, 18:117--143, 2013.Google Scholar
- E. Goubault and S. Putot. Under-approximations of computations in real numbers based on generalized affine arithmetic. In SAS, pages 137--152, 2007. Google ScholarDigital Library
- E. Goubault and S. Putot. A zonotopic framework for functional abstractions. CoRR, abs/0910.1763, 2009.Google Scholar
- E. Goubault, S. Putot, and F. Vedrine. Modular static analysis with zonotopes. In SAS'12, volume 7460 of LNCS, pages 24--40. Springer, 2012. Google ScholarDigital Library
- C. L. Guernic and A. Girard. Reachability analysis of hybrid systems using support functions. In CAV, 2009. Google ScholarDigital Library
- D. Henrion and C. Louembet. Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design. International Journal of Control, 85(8):1083--1092, 2012.Google ScholarCross Ref
- D. Ishii, A. Goldsztejn, and C. Jermann. Interval-based projection method for under-constrained numerical systems. Constraints, 17(4):432--460, 2012. Google ScholarDigital Library
- B. Jeannet and A. Miné. Apron: A library of numerical abstract domains for static analysis. In CAV'09, pages 661--667. Springer, 2009. Google ScholarDigital Library
- A. Kanade, R. Alur, F. Ivančić, S. Ramesh, S. Sankaranarayanan, and K. C. Shashidhar. Generating and analyzing symbolic traces of simulink/stateflow models. In CAV'09. Springer, 2009. Google ScholarDigital Library
- E. Kaucher. Interval analysis in the extended interval space IR. Comput. (Supplementum) 2, 1980.Google Scholar
- A. B. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In HSCC '00, pages 202--214. Springer, 2000. Google ScholarDigital Library
- R. J. Lohner. Enclosing the solutions of ordinary initial and boundary value problems. In Computer Arithmetic: Scientific Computation and Programming Languages, pages 255--286. Wiley-Teubner, 1987.Google Scholar
- T. Nghiem, S. Sankaranarayanan, G. Fainekos, F. Ivancić, A. Gupta, and G. J. Pappas. Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems. In HSCC'10. ACM, 2010. Google ScholarDigital Library
- M. A. B. Sassi, R. Testylier, T. Dang, and A. Girard. Reachability analysis of polynomial systems using linear programming relaxations. In ATVA, 2012. Google ScholarDigital Library
Index Terms
- Inner approximated reachability analysis
Recommendations
An Inner-Outer Approximation Approach to Chance Constrained Optimization
Nonlinear chance constrained optimization (CCOPT) problems are known to be difficult to solve. This work proposes a smooth approximation approach consisting of an inner and an outer analytic approximation of chance constraints. In this way, CCOPT is ...
Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, that is, a linear optimization problem over the convex but computationally intractable cone ...
Fault Tolerant Reachability for Directed Graphs
DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363Let $$G=V,E$$ be an n-vertices m-edges directed graph. Let $$s\in V$$ be any designated source vertex, and let T be an arbitrary reachability tree rooted at s. We address the problem of finding a set of edges $$\mathcal{E}\subseteq E\backslash T$$ of ...
Comments