Series of Abstractions for Hybrid Automata

  title={Series of Abstractions for Hybrid Automata},
  author={Ashish Tiwari and Gaurav Khanna},
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… CONTINUE READING
Highly Cited
This paper has 241 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 149 extracted citations

Detecting Unsatisfiability of Nonlinear Constraints Using DISCOVERER

2009 International Conference on Information Technology and Computer Science • 2009
View 5 Excerpts
Highly Influenced

241 Citations

Citations per Year
Semantic Scholar estimates that this publication has 241 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 22 references

Safety Verification Proofs for Physical Systems

SystemsTony Loeser, Yumi Iwasaki, Richard FikesKnowledge
View 3 Excerpts

and P

T. A. Henzinger, P. W. Kopke, A. Puri
Varaiya. What’s decidable about hybrid automata? Journal of Computer and System Sciences, 57:94–124, • 1998
View 3 Excerpts

and Preußig

O. Stursberg, S. Kowalewski, I. Hoffmann
Comparing timed and hybrid automata as approximations of continuous systems. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors, Hybrid Systems IV, volume 1273 of LNCS, pages 361–377. Springer-Verlag, • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…