Series of abstractions for hybrid automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2289, Issue , 2002, Pages 465-478

  Tiwari, Ashish ^a   Khanna, Gaurav ^b  

^a SRI INTERNATIONAL   (United States)

^b LONG ISLAND UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; COMPUTATION THEORY; HYBRID SYSTEMS;

ARBITRARY POLYNOMIAL; CONTINUOUS FLOWS; CONTINUOUS VARIABLES; DECISION PROCEDURE; DISCRETE TRANSITIONS; HYBRID AUTOMATONS; QUANTIFIER ELIMINATION; REAL CLOSED FIELDS;

THEOREM PROVING;

EID: 84945271493     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45873-5_36     Document Type: Conference Paper

References (23)

1. 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 [7], pages 209–229.
2. R. Alur, R. Grosu, Y. Hur, V. Kumar, and I. Lee. Modular specifications of hybrid systems in CHARON. In Proc of 3rd Intl Workshop on Hybrid Systems: Computation and Control, volume 1790 of LNCS, pages 6–19, 2000.
3. 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.
4. 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. www.eecis.udel.edu/~saclib/.
5. A. Chutinam and B. H. Krogh. Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In Hybrid Systems: Computation and Control, volume 1569 of LNCS, pages 76–90. Springer-Verlag, 1999.
6. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Proc. Second GI Conf. Automata Theory and Formal Languages, volume 33 of LNCS, pages 134–183, 1975.
7. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel (eds.). Hybrid Systems, volume 736 of LNCS. Springer-Verlag, Berlin, 1993.
8. 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.
9. T. A. Henzinger. Hybrid automata with finite bisimulations. In Proc. 22nd ICALP, volume 944 of LNCS, pages 324–335. Springer-Verlag, 1995.
10. T. A. Henzinger, P-H. Ho, and H. Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control, 43:540–554, 1998.
11. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? Journal of Computer and System Sciences, 57:94–124, 1998.
12. H. Hong. Quantifier elimination in elementary algebra and geometry by partial cylindrical algebraic decomposition version 13. In The world wide web, 1995. www.eecis.udel.edu/~saclib/.
13. Computer Science Laboratory. SAL: Symbolic analysis laboratory. http://www.csl.sri.com/projects/sal/.
14. T. Loeser, Y. Iwasaki, and R. Fikes. Safety verification proofs for physical systems. In Proc. of the 12th Intl. Workshop on Qualitative Reasoning, pages 88–95. AAAI Press, 1998.
15. 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.
16. P. J. Mosterman and G. Biswas. Monitoring, prediction, and fault isolation in dynamic physical systems. AAAI-97, pages 100–105, 1997.
17. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. In Hybrid Systems [7], pages 149–178.
18. 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.
19. N. Shankar, S. Owre, and J. M. Rushby. The PVS Proof Checker: A Reference Manual. Computer Science Lab, SRI International, 1993.
20. B. Shults and B. J. Kuipers. Proving properties of continuous systems: qualitative simulation and temporal logic. AI Journal, 92:91–129, 1997.
21. 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.
22. O. Stursberg, S. Kowalewski, I. Hoffmann, and Preußig. 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.
23. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1948. Second edition.