Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 850789, 5 pages
http://dx.doi.org/10.1155/2014/850789
Research Article

Approximate Equivalence of the Hybrid Automata with Taylor Theory

1Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu 610041, China
2Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi University for Nationalities, Guangxi 530006, China
3Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China

Received 26 January 2014; Revised 7 April 2014; Accepted 22 April 2014; Published 11 May 2014

Academic Editor: Guiming Luo

Copyright © 2014 Anping He et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Lanotte and S. Tini, “Taylor approximation for hybrid systems,” Information and Computation, vol. 205, no. 11, pp. 1575–1607, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. R. Alur, C. Courcoubetis, N. Halbwachs et al., “The algorithmic analysis of hybrid systems,” in Theoretical Computer Science, vol. 138, pp. 3–34, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. T. A. Henzinger, P.-H. Ho, and H. Wong-toi, “Algorithmic analysis of nonlinear hybrid systems,” IEEE Transactions on Automatic Control, vol. 43, no. 4, pp. 540–554, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. T. A. Henzinger, “The theory of hybrid automata,” Technical Report UCB/ERL M96/28, EECS Department, University of California, Berkeley, Calif, USA, 1996. View at Google Scholar
  5. R. Gentilini, K. Schneider, and B. Mishra, “Successive abstractions of hybrid automata for monotonic CTL model checking,” in Proceedings of the International Symposium on Logical Foundations of Computer Science (LFCS '07), pp. 224–240, June 2007. View at Scopus
  6. A. Podelski and S. Wagner, “Model checking of hybrid systems: from reachability towards stability,” in Hybrid Systems: Computation and Control, vol. 3927 of Lecture Notes in Computer Science, pp. 507–521, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, “What's decidable about hybrid automata?” Journal of Computer and System Sciences, vol. 57, no. 1, pp. 94–124, 1998. View at Google Scholar · View at Scopus
  8. B. C. Williams and M. M. Henry, Model-based estimation of probabilistic hybrid automata [M.S. thesis], Howard University, Washington, DC, USA, 2002.
  9. J. M. B. Braman and R. M. Murray, “Probabilistic safety analysis of sensordriven hybrid automata,” Hybrid Systems: Computation and Control, 2009. View at Google Scholar
  10. A. Edalat and D. Pattinson, “Denotational semantics of hybrid automata,” in Proceedings of the Foundations of Software Science and Computation Structure (FoSSaCS '06), pp. 231–245, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. R. Alur, T. A. Henzinger, G. Lafferriere, and G. J. Pappas, “Discrete abstractions of hybrid systems,” Proceedings of the IEEE, vol. 88, no. 7, pp. 971–984, 2000. View at Publisher · View at Google Scholar · View at Scopus
  12. T. A. Henzinger and R. Majumdar, “Symbolic model checking for rectangular hybrid systems,” in Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems (TACAS '00), Lecture Notes in Computer Science, pp. 142–156, Springer, New York, NY, USA, 2000.
  13. A. M. Bayen, E. Cruck, R. M. Bayen, and C. J. Tomlin, “Guaranteed overapproximations of unsafe sets for continuous and hybrid systems: solving the hamilton-jacobi equation using viability techniques,” in Hybrid Systems: Computation and Control, pp. 90–104, Springer, New York, NY, USA, 2002. View at Google Scholar
  14. A. Chutinan and B. H. Krogh, Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations, Springer,, New York, NY, USA, 1999.
  15. A. B. Kurzhanski and P. Varaiya, “On reachability under uncertainty,” SIAM Journal on Control and Optimization, vol. 41, no. 1, pp. 181–216, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. M. Fränzle, “Analysis of hybrid systems: an ounce of realism can save an infinity of states,” in Computer Science Logic, vol. 1683 of Lecture Notes in Computer Science, pp. 126–140, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. M. Fränzle, “What will be eventually true of polynomial hybrid automata?” in Theoretical Aspects of Computer Software, vol. 2215 of Lecture Notes in Computer Science, pp. 340–359, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet