Series of Abstractions for Hybrid Automata
We present a technique based on the use of the quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. Our technique works on linear and non-linear polynomial hybrid systems, that is, the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. We have a prototype tool in the SAL environment  which is built over the theorem prover PVS . The technique promises to scale well to large and complex hybrid systems.
Unable to display preview. Download preview PDF.
- R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems , pages 209–229.Google Scholar
- R. Alur, T. A Henzinger, G. Lafferriere, and G. J. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88(2):971–984, July 2000.Google Scholar
- B. Buchberger, G. E. Collins, M. J. Encarnacion, H. Hong, J. R. Johnson, W. Krandick, R. Loos, A. M. Mandache, A. Neubacher, and H. Vielhaber. SACLIB 1.1 user’s guide. In RISC-Linz Report Series, Tech Report No 93–19. Kurt Gödel Institute, 1993. http://www.eecis.udel.edu/~saclib/.
- G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Proc. Second GI Conf. AutomataTheory and Formal Languages, volume 33 of LNCS, pages 134–183, 1975.Google Scholar
- R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel (eds.). Hybrid Systems, volume 736 of LNCS. Springer-Verlag, Berlin, 1993.Google Scholar
- M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science FOCS, pages 453–462, 1995.Google Scholar
- T. A. Henzinger. Hybrid automata with finite bisimulations. In Proc. 22nd ICALP, volume 944 of LNCS, pages 324–335. Springer-Verlag, 1995.Google Scholar
- H. Hong. Quantifier elimination in elementary algebra and geometry by partial cylindrical algebraic decomposition version 13. In The world wide web, 1995. http://www.eecis.udel.edu/~saclib/.
- T. Loeser, Y. Iwasaki, and R. Fikes. Safety veri.cation proofs for physical systems. In Proc. of the 12th Intl. Workshop on Qualitative Reasoning, pages 88–95. AAAI Press, 1998.Google Scholar
- I. Mitchell, A. Bayen, and C. Tomlin. Validating a hamilton-jacobi approximation to hybrid system reachable sets. In M. D. Benedetto and A. L. Sangiovanni-Vincentelli, editors, HSCC 4th Intl. Workshop, volume 2034 of LNCS, 2001.Google Scholar
- P. J. Mosterman and G. Biswas. Monitoring, prediction, and fault isolation in dynamic physical systems. AAAI-97, pages 100–105, 1997.Google Scholar
- X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. In Hybrid Systems , pages 149–178.Google Scholar
- A. Olivero, J. Sifakis, and S. Yovine. Using abstractions for the verification of linear hybrid systems. In Proc. of the 6th Computer-Aided Verification CAV, volume 818 of LNCS, pages 81–94, 1994.Google Scholar
- N. Shankar, S. Owre, and J. M. Rushby. The PVS Proof Checker: A Reference Manual. Computer Science Lab, SRI International, 1993.Google Scholar
- O. Sokolsky and H. S. Hong. Qualitative modeling of hybrid systems. In Proc. of the Montreal Workshop, 2001. Available from http://www.cis.upenn.edu/~rtg/rtg_papers.htm.
- A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1948. Second edition.Google Scholar