Generating Box Invariants

Citation

Tiwari, A. (2008). Generating Box Invariants. In: Egerstedt, M., Mishra, B. (eds) Hybrid Systems: Computation and Control. HSCC 2008. Lecture Notes in Computer Science, vol 4981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78929-1_58

Abstract

Box invariant sets are box-shaped positively invariant sets. We show that box invariants are computable for a large class of nonlinear and hybrid systems. The technique for computing these invariants is based on nonlinear constraint solving. This paper also shows that the class of multiaffine systems, which has been used successfully for modeling and analyzing regulatory and biochemical reaction networks, can be generalized to the class of monotone and quasi-monotone systems without losing any of its nice properties.

Keywords: Hybrid System, Polynomial System, Nice Property, Nonlinear Constraint, Geometric Programming

↓ View online

Read more from SRI

  • An arid, rural Nevada landscape

    Can AI help us find valuable minerals?

    SRI’s machine learning-based geospatial analytics platform, already adopted by the USGS, is poised to make waves in the mining industry.

  • Two students in a computer lab

    Building a lab-to-market pipeline for education

    The SRI-led LEARN Network demonstrates how we can get the best evidence-based educational programs to classrooms and students.

  • Code reflected in a man's eyeglasses

    LLM risks from A to Z

    A new paper from SRI and Brazil’s Instituto Eldorado delivers a comprehensive update on the security risks to large language models.