Abstract
We present a powerful computational method for automatically generating polynomial invariants of hybrid systems with linear continuous dynamics. When restricted to linear continuous dynamical systems, our method generates a set of polynomial equations (algebraic set) that is the best such over-approximation of the reach set. This shows that the set of algebraic invariants of a linear system is computable. The extension to hybrid systems is achieved using the abstract interpretation framework over the lattice defined by algebraic sets. Algebraic sets are represented using canonical Gröbner bases and the lattice operations are effectively computed via appropriate Gröbner basis manipulations.
The research of the first author was partially supported by Spanish FPU grant ref. AP2002-3693 and the projects Maverish (MCYT TIC2001-2476-C03-01) and LogicTools (TIN2004-03382) funded by the Spanish Ministry of Education and Science. The second author was supported in part by the National Science Foundation under grants CCR-0311348 and CCR-ITR-0326540 and NASA Langley Research Center contract NAS1-00108 to Rannoch Corporation.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 209–229. Springer, Heidelberg (1993)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
Alur, R., Pappas, G.J. (eds.): HSCC 2004. LNCS, vol. 2993. Springer, Heidelberg (2004)
Bryant, R.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)
Chutinan, A., Krogh, B.H.: Computing polyhedral approximations to flow pipes for dynamic systems. In: 37th IEEE Conference on Decision and Control (1998)
Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: 4th ACM Symp. on Principles of Programming Languages, POPL 1977, pp. 238–252 (1977)
Cox, D., Little, J., O’Shea, D.: Ideals, varieties, and algorithms. Springer, New York (1996)
Dang, T., Maler, O.: Reachability analysis via face lifting. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 96–109. Springer, Heidelberg (1998)
Grayson, D.R., Stillman, M.E.: Macaulay 2: A software system for research in algebraic geometry, Available at: http://www.math.uiuc.edu/Macaulay2/
Halbwachs, N., Proy, Y.-E., Raymond, P.: Verification of linear hybrid systems by means of convex approximations. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 223–237. Springer, Heidelberg (1994)
Henzinger, T.A.: The symbolic approach to hybrid systems. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404. Springer, Heidelberg (2002), http://www-cad.eecs.berkeley.edu/~tah/
Henzinger, T.A., Ho, P.-H.: A note on abstract interpretation strategies for hybrid automata. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999, pp. 252–264. Springer, Heidelberg (1995)
Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control 43, 540–554 (1998)
Kurzhanski, A.B., Varaiya, P.: On ellipsoidal techniques for reachability analysis. Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms 9, 347–367 (2002)
Lafferriere, G., Pappas, G.J., Yovine, S.: A new class of decidable hybrid systems. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 137–151. Springer, Heidelberg (1999)
Lafferriere, G., Pappas, G.J., Yovine, S.: Symbolic reachability computations for families of linear vector fields. J. Symbolic Computation 32(3), 231–253 (2001)
Rodriguez-Carbonell, E., Kapur, D.: An abstract interpretation approach for automatic generation of polynomial invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol. 3148. Springer, Heidelberg (2004)
Sankaranarayanan, S., Sipma, H., Manna, Z.: Constructing invariants for hybrid systems. In: Alur, Pappas [3], pp. 539–554
Sankaranarayanan, S., Sipma, H., Manna, Z.: Constructing invariants for hybrid systems. Formal Methods in System Design (2004) (Preprint submitted for publication)
Tiwari, A.: Approximate reachability for linear systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 514–525. Springer, Heidelberg (2003)
Tiwari, A., Khanna, G.: Nonlinear systems: Approximating reach sets. In: Alur, Pappas [3], pp. 600–614
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodríguez-Carbonell, E., Tiwari, A. (2005). Generating Polynomial Invariants for Hybrid Systems. In: Morari, M., Thiele, L. (eds) Hybrid Systems: Computation and Control. HSCC 2005. Lecture Notes in Computer Science, vol 3414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31954-2_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-31954-2_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25108-8
Online ISBN: 978-3-540-31954-2
eBook Packages: Computer ScienceComputer Science (R0)