Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2968478.2968484acmotherconferencesArticle/Chapter ViewAbstractPublication PagesesweekConference Proceedingsconference-collections
research-article

Darboux-type barrier certificates for safety verification of nonlinear hybrid systems

Authors Info & Claims
Published:01 October 2016Publication History

ABSTRACT

Benefit from less computational difficulty, barrier certificate based method has attracted much attention in safety verification of hybrid systems. Barrier certificates are inherent existences of a hybrid system and may have different types. A set of well-defined verification conditions is a prerequisite for successfully identifying barrier certificates of a specific type. Therefore, how to define verification conditions that can identify barrier certificates invisible to existing conditions becomes an essential problem in barrier certificate based verification. This paper proposes a set of verification conditions that helps to construct a new type of barrier certificate, namely, the Darboux-type barrier certificate made of Darboux polynomial. The proposed verification conditions provide powerful aids in non-linear hybrid system verification as the Darboux-type barrier certificates can verify systems that may not be settled by existing verification conditions.

Furthermore, we give a novel computational approach, combining the sampling-based relaxation method with least-squares and quadratic programming (LS-QP) alternating projection, to find Darboux-type barrier certificates. We demonstrate on the benchmark examples from the literature that our verification conditions can enhance the capability of barrier certificate based approaches through successfully verifying those systems that are difficult to be handled by existing verification conditions, and our algorithm is efficient.

References

  1. Bobiti, R., and Lazar, M. A delta-sampling verification theorem for discrete-time, possibly discontinuous systems. In Proc. of the Hybrid Systems: Computation and Control (HSCC) (2015), ACM, pp. 140--148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bouissou, O., Chapoutot, A., Djaballah, A., and Kieffer, M. Computation of parametric barrier functions for dynamical systems using interval analysis. In Proc. of the IEEE Conference on Decision and Control (CDC) (2014), IEEE, pp. 753--758.Google ScholarGoogle ScholarCross RefCross Ref
  3. Brown, C. W. QEPCAD B: a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin 37, 4 (2003), 97--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Brown, R. C., and Hinton, D. B. Lyapunov inequalities and their applications. In Survey on Classical Inequalities. Springer, 2000, pp. 1--25.Google ScholarGoogle ScholarCross RefCross Ref
  5. Cheze, G. Computation of darboux polynomials and rational first integrals with bounded degree in polynomial time. Journal of Complexity 27, 2 (2011), 246--262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Dai, L., Gan, T., Xia, B., and Zhan, N. Barrier certificates revisited. Journal of Symbolic Computation, In Press (2015).Google ScholarGoogle Scholar
  7. Ferragut, A., and Gasull, A. Seeking darboux polynomials. Acta Applicandae Mathematicae 139, 1 (2015), 167--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ghorbal, K., Sogokon, A., and Platzer, A. A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets. Computer Languages, Systems, and Structures (2016).Google ScholarGoogle Scholar
  9. Goubault, E., Jourdan, J.-H., Putot, S., and Sankaranarayanan, S. Finding non-polynomial positive invariants and lyapunov functions for polynomial systems through darboux polynomials. In Proc. of the American Control Conference (ACC) (2014), IEEE, pp. 3571--3578.Google ScholarGoogle ScholarCross RefCross Ref
  10. Gulwani, S., and Tiwari, A. Constraint-based approach for analysis of hybrid systems. In Proc. of the Computer Aided Verification (CAV) (2008), vol. 5123, pp. 190--203. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Halmos, P. R. Finite-Dimensional Vector Spaces. Springer, 1974.Google ScholarGoogle ScholarCross RefCross Ref
  12. Henzinger, T. The theory of hybrid automata. In Proc. of the IEEE Symposium on Logic in Computer Science (LICS) (1996), pp. 278--292. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kapinski, J., and Deshmukh, J. Discovering forward invariant sets for nonlinear dynamical systems. In Interdisciplinary Topics in Applied Mathematics, Modeling and Computational Science. Springer, 2015, pp. 259--264.Google ScholarGoogle Scholar
  14. Kapinski, J., Deshmukh, J. V., Sankaranarayanan, S., and Aréchiga, N. Simulation-guided lyapunov analysis for hybrid dynamical systems. In Proc. of the Hybrid Systems: Computation and Control (HSCC) (2014), ACM, pp. 133--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Kong, H., He, F., Song, X., Hung, W. N., and Gu, M. Exponential-condition-based barrier certificate generation for safety verification of hybrid systems. In Proc. of the Computer Aided Verification (CAV) (2013), Springer, pp. 242--257.Google ScholarGoogle Scholar
  16. Kong, H., Song, X., Han, D., Gu, M., and Sun, J. A new barrier certificate for safety verification of hybrid systems. The Computer Journal 57, 7 (2014), 1033--1045.Google ScholarGoogle ScholarCross RefCross Ref
  17. Kočvara, M., and Stingl, M. PENBMI user's guide (version 2.0). Available at http://www.penopt.com, 2005.Google ScholarGoogle Scholar
  18. Liu, J., Zhan, N., and Zhao, H. Computing semi-algebraic invariants for polynomial dynamical systems. In Proc. of the Embedded Software (EMSOFT) (2011), ACM, pp. 97--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Llibre, J., and Valls, C. On the integrability of the einstein---yang---mills equations. Journal of Mathematical Analysis and Applications 336, 2 (2007), 1203--1230.Google ScholarGoogle ScholarCross RefCross Ref
  20. Matringe, N., Moura, A. V., and Rebiha, R. Generating invariants for non-linear hybrid systems by linear algebraic methods. In Proc. of the Static Analysis. Springer, 2010, pp. 373--389. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Platzer, A., and Clarke, E. M. Computing differential invariants of hybrid systems as fixedpoints. Formal Methods in System Design 35, 1 (2009), 98--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Prajna, S., and Jadbabaie, A. Safety verification of hybrid systems using barrier certificates. In Proc. of the Hybrid Systems: Computation and Control (HSCC) (2004), Springer, pp. 477--492.Google ScholarGoogle Scholar
  23. Prajna, S., Jadbabaie, A., and Pappas, G. A framework for worst-case and stochastic safety verification using barrier certificates. IEEE Transactions on Automatic Control 52, 8 (2007), 1415--1429.Google ScholarGoogle ScholarCross RefCross Ref
  24. Prajna, S., Papachristodoulou, A., and Parrilo, P. Sostools: Sum of squares optimization toolbox for matlab, 2002. URL: http://www.cds.caltech.edu/sostools.Google ScholarGoogle Scholar
  25. Rachid Rebiha, Arnaldo V. Moura, N. M. Generating invariants for non-linear hybrid systems. Theoretical Computer Science 594 (2015), 180--200. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Rodríguez, E., and Tiwari, A. Generating polynomial invariants for hybrid systems. In Proc. of the Hybrid Systems: Computation and Control (HSCC) (2005), pp. 590--605. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Sankaranarayanan, S., Sipma, H., and Manna, Z. Constructing invariants for hybrid systems. Formal Methods in System Design 32 (2008), 25--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Sloth, C., Pappas, G. J., and Wisniewski, R. Compositional safety analysis using barrier certificates. In Proc. of the Hybrid Systems: Computation and Control (HSCC) (2012), ACM, pp. 15--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Sogokon, A., Ghorbal, K., Jackson, P. B., and Platzer, A. A method for invariant generation for polynomial continuous systems. In Proc. of the Verification, Model Checking, and Abstract Interpretation (VMCAI) (2016), Springer, pp. 268--288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Sturm, T., and Tiwari, A. Verification and synthesis using real quantifier elimination. In Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC) (2011), ACM Press, pp. 329--336. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Yang, Z., Wu, M., and Lin, W. Exact verification of hybrid systems based on bilinear SOS representation. ACM Transactions on Embedded Computing Systems 14, 1 (2015), 1--19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Zaki, M., Tahar, S., and Bois, G. Combining constraint solving and formal methods for the verification of analog designs. Tech. rep., Concordia University, 2007.Google ScholarGoogle Scholar
  33. Zaki, M., Tahar, S., and Bois, G. A symbolic approach for the safety verification of continuous systems. In Proc. of the International Conference on Computational Sciences (2007), pp. 93--100.Google ScholarGoogle Scholar

Index Terms

  1. Darboux-type barrier certificates for safety verification of nonlinear hybrid systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        EMSOFT '16: Proceedings of the 13th International Conference on Embedded Software
        October 2016
        260 pages
        ISBN:9781450344852
        DOI:10.1145/2968478

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate60of203submissions,30%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader