Abstract
In this article, we address the problem of safety verification of nonlinear hybrid systems. A hybrid symbolic-numeric method is presented to compute exact inequality invariants of hybrid systems efficiently. Some numerical invariants of a hybrid system can be obtained by solving a bilinear SOS programming via the PENBMI solver or iterative method, then the modified Newton refinement and rational vector recovery techniques are applied to obtain exact polynomial invariants with rational coefficients, which exactly satisfy the conditions of invariants. Experiments on some benchmarks are given to illustrate the efficiency of our algorithm.
- R. Alur, T. Dang, and F. Ivancic. 2006. Predicate abstraction for reachability analysis of hybrid systems. ACM Transactions on Embedded Computing Systems 5, 1 (2006), 152--199. Google Scholar
Digital Library
- J. Anderson and A. Papachristodoulou. 2012. A decomposition technique for nonlinear dynamical system analysis. IEEE Transactions on Automatic Control 57, 6 (2012), 1516--1521.Google Scholar
Cross Ref
- G. Chesi. 2010. LMI techniques for optimization over polynomials in control: a survey. IEEE Transactions on Automatic Control 55, 11 (2010), 2500--2510.Google Scholar
Cross Ref
- A. Chutinan and B. H. Krogh. 2003. Computational techniques for hybrid system verification. IEEE T AUTOMAT CONTR 48, 1 (2003), 64--75.Google Scholar
Cross Ref
- Mohab Safey El Din. 2003. RAGLib (Real Algebraic Library Maple Package). Available at http://www- calfor.lip6.fr/∼safey/RAGLib.Google Scholar
- A. Dolzmann and T. Sturm. 1997. Redlog: Computer algebra meets computer logic. Acm Sigsam Bulletin 31, 2 (1997), 2--9. Google Scholar
Digital Library
- G. H. Golub and C. F. Van Loan. 1996. Matrix Computations (3rd ed.). Johns Hopkins University Press. Google Scholar
Digital Library
- S. Gulwani and A. Tiwari. 2008. Constraint-based approach for analysis of hybrid systems. In Proceedings of the 20th International Conference on Computer Aided Verification (CAV’08). Springer, 190--203. Google Scholar
Digital Library
- T. A. Henzinger. 1996. The theory of hybrid automata. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 278--292. Google Scholar
Digital Library
- E. Kaltofen, B. Li, Z. Yang, and L. Zhi. 2008. Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC’08). ACM, New York, 155--164. Google Scholar
Digital Library
- E. Kaltofen, B. Li, Z. Yang, and L. Zhi. 2012. Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J SYMB COMPUT. 47 (2012), 1--15. Google Scholar
Digital Library
- M. Kočvara and M. Stingl. 2003. PENNON: A code for convex nonlinear and semidefinite programming. Optimization Methods and Software 18, 3 (2003), 317--333.Google Scholar
Cross Ref
- M. Kočvara and M. Stingl. 2005. PENBMI User’s Guide (Version 2.0). (2005). Available at http://www.penopt.com.Google Scholar
- G. Lafferriere, G. J. Pappas, and S. Yovine. 2001. Symbolic reachability computations for families of linear vector fields. J SYMB COMPUT. 32, 3 (2001), 231--253. Google Scholar
Digital Library
- J. C. Lagarias. 1985. The computational complexity of simultaneous diophantine approximation problems. SIAM J COMPUT 14 (1985), 196--209. Google Scholar
Digital Library
- J. B. Lasserre. 2010. Moments, Positive Polynomials and Their Applications. Imperial College Press.Google Scholar
- F. Leibfritz and E. M. E. Mostafa. 2002. An interior point constrained trust region method for a special class of nonlinear semidefinite programming problems. SIAM Journal on Control and Optimization 12, 4 (2002), 1048--1074. Google Scholar
Digital Library
- W. Lin, M. Wu, Z. Yang, and Z. Zeng. 2014. Exact safety verification of hybrid systems using sums-of-squares representation. Science China Information Sciences 57, 5 (2014), 1--13.Google Scholar
Cross Ref
- J. Liu, N. Zhan, and H. Zhao. 2011. Computing semi-algebraic invariants for polynomial dynamical systems. In Proceedings of the International Conference on Embedded Software (EMSOFT’11). ACM, 97--106. Google Scholar
Digital Library
- P. Parrilo. 2003. Semidefinite programming relaxation for semialgebraic problems. Mathematical Programming Series B 96, 2 (2003), 293--320.Google Scholar
Cross Ref
- A. Platzer and E. M. Clarke. 2007. The image computation problem in hybrid systems model checking. In Hybrid Systems: Computation and Control, HSCC. Springer, 473--486. Google Scholar
Digital Library
- A. Platzer and E. M. Clarke. 2009. Computing differential invariants of hybrid systems as fixedpoints. Formal Methods in System Design 35, 1 (2009), 98--120. Google Scholar
Digital Library
- S. Prajna. 2005. Optimization-Based Methods for Nonlinear and Hybrid Systems Verification. Ph.D. Dissertation. California Institute of Technology. Google Scholar
Digital Library
- S. Prajna and A. Jadbabaie. 2004. Safety verification of hybrid systems using barrier certificates. In Proceedings of the 7th International Workshop on Hybrid Systems: Computation and Control. 477--492.Google Scholar
- S. Ratschan and Z. She. 2006. Constraints for continuous reachability in the verification of hybrid systems. In Artificial Intelligence and Symbolic Computation. Springer, 196--210. Google Scholar
Digital Library
- S. Ratschan and Z. She. 2007. Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Transactions of Automatic Control 6, 1 (2007), 573--589. Google Scholar
Digital Library
- S. Ratschan and Z. She. 2010. Providing a basin of attraction to a target region of polynomial systems by computation of Lyapunov-like functions. SIAM Journal on Control and Optimization 48, 7 (2010), 4377--4394. Google Scholar
Digital Library
- E. Rodríguez-Carbonell and A. Tiwari. 2005. Generating polynomial invariants for hybrid systems. In Hybrid Systems: Computation and Control, HSCC. Lecture Notes in Computer Science, Vol. 3414. 590--605. Google Scholar
Digital Library
- S. Sankaranarayanan, H. Sipma, and Z. Manna. 2008. Constructing invariants for hybrid systems. Formal Methods in System Design 32, 1 (2008), 25--55. Google Scholar
Digital Library
- G. A. Shah, M. Völker, C. Sonntag, and S. Engell. 2008. A barrier certificate approach to the safety verification of a chemical reactor. In Proceedings of the 17th IFAC World Congress. 6932--6937.Google Scholar
- C. Sloth, G. J. Pappas, and R. Wisniewski. 2012. Compositional safety analysis using barrier certificates. In Proceedings of the 15th ACM International Conference on Hybrid Systems: Computation and Control. ACM, New York, 15--24. Google Scholar
Digital Library
- T. Sturm and A. Tiwari. 2011. Verification and synthesis using real quantifier elimination. In Proceedings of ISSAC. ACM, New York, 329--336. Google Scholar
Digital Library
- A. Tiwari. 2003. Approximate reachability for linear systems. In Hybrid Systems: Computation and Control, HSCC (LNCS), Vol. 2623. 514--525. Google Scholar
Digital Library
- M. Wu and Z. Yang. 2011. Generating invariants of hybrid systems via sums-of-squares of polynomials with rational coefficients. In Proceedings of the 2011 International Workshop on Symbolic-Numeric Computing. ACM, New York, 104--111. Google Scholar
Digital Library
- B. Xia. 2007. DISCOVERER: A tool for solving semi-algebraic systems. ACM Communications in Computer Algebra 41, 3 (2007), 102--103. Google Scholar
Digital Library
- H. Yanami and H. Anai. 2007. The Maple package SyNRAC and its application to robust control design. Future Generation Computer Systems 23, 5 (2007), 721--726. Google Scholar
Digital Library
- M. H. Zaki, S. Tahar, and G. Bois. 2007a. Combining Constraint Solving and Formal Methods for the Verification of Analog Designs. Technical Report. Concordia University.Google Scholar
- M. H. Zaki, S. Tahar, and G. Bois. 2007b. A Symbolic approach for the safety verification of continuous systems. In Proceedings of the International Conference on Computational Sciences. 93--100.Google Scholar
Index Terms
Exact Safety Verification of Hybrid Systems Based on Bilinear SOS Representation
Recommendations
Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters
HSCC '17: Proceedings of the 20th International Conference on Hybrid Systems: Computation and ControlIn this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u, x)=0, parametric ...
Exponential-Condition-Based Barrier Certificate Generation for Safety Verification of Hybrid Systems
CAV 2013: Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044A barrier certificate is an inductive invariant function which can be used for the safety verification of a hybrid system. Safety verification based on barrier certificate has the benefit of avoiding explicit computation of the exact reachable set which ...
A hybrid integral for parametrized rational functions
SNC '07: Proceedings of the 2007 international workshop on Symbolic-numeric computationWe present a hybrid integral to obtain symbolic results of an indefinite integral where the integrand is an univariate rational function whose coeficients have a parameter. We consider calculating power series roots of the denominator polynomial by ...






Comments