Series of Abstractions for Hybrid Automata

  • Ashish Tiwari
  • Gaurav Khanna
Conference paper

DOI: 10.1007/3-540-45873-5_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2289)
Cite this paper as:
Tiwari A., Khanna G. (2002) Series of Abstractions for Hybrid Automata. In: Tomlin C.J., Greenstreet M.R. (eds) Hybrid Systems: Computation and Control. HSCC 2002. Lecture Notes in Computer Science, vol 2289. Springer, Berlin, Heidelberg


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 [13] which is built over the theorem prover PVS [19]. The technique promises to scale well to large and complex hybrid systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ashish Tiwari
    • 1
  • Gaurav Khanna
    • 2
  1. 1.SRI InternationalMenlo ParkUSA
  2. 2.Theoretical and Computational Studies GroupLong Island University, SouthamptonSouthampton

Personalised recommendations