Taylor approximation for hybrid systems

Information and Computation

Volumn 205, Issue 11, 2007, Pages 1575-1607

  Lanotte, Ruggero ^a   Tini, Simone ^a  

^a UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

HYBRID SYSTEMS;

APPROXIMATION TECHNIQUES; HYBRID AUTOMATONS; POLYNOMIAL HYBRID AUTOMATON; TAYLOR APPROXIMATION; TAYLOR POLYNOMIALS;

POLYNOMIAL APPROXIMATION;

EID: 84855196801     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.05.004     Document Type: Article

References (32)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, The algorithmic analysis of hybrid systems, Theor. Comput. Sci. 138 (1) (1995) 3-34.
2. R. Alur, T. Dang, F. Ivanĉić, Predicate abstraction for reachability analysis of hybrid systems, ACM Trans. Embedded Comput. Syst. 5 (1) (2006) 152-199.
3. R. Alur, D. L. Dill, A theory of timed automata, Theor. Comput. Sci. 126 (2) (1994) 183-235.
4. R. Alur, T. A. Henzinger, P. H. Ho, Automatic symbolic verification of embedded systems, IEEE Trans. Software Eng. 22 (6) (1996) 181-201. (Pubitemid 126771667)
5. R. Alur, T. A. Henzinger, G. Lafferriere, G. J. Pappas, Discrete abstractions of hybrid systems, Proc. IEEE 88 (7) (2000) 971-984.
6. E. Asarin, O. Bournez, T. Dang, O. Maler, A. Pnueli, Effective synthesis of switching controllers for linear systems, Proc. IEEE 88 (7) (2000) 1011-1025.
7. A. M. Bayen, E. Crück, C. J. Tomlin, Guaranteed over approximations of unsafe sets for continuous and hybrid systems: solving the Hamilton-Jacobi equation using viability techniques, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 2289, Springer, Berlin, 2002, pp. 90-104.
8. E. Clarke, A. Fehnker, Z. Han, B. Krogh, J. Ouaknine, O. Stursberg, M. Theobald, Abstraction and counterexample-guided refinement in model checking of hybrid systems, Int. J. Found. Comput. Sci. 14 (4) (2003) 583-604.
9. A. Chutinan, B. H. Krogh, Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximation, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 1569, Springer, Berlin, 1999, pp. 76-90.
10. A. Fehnker, F. Ivanĉić, Benchmarks for hybrid systems verification, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 2993, Springer, Berlin, 2004, pp. 326-341.
11. M. Fränzle, Analysis of hybrid systems: an ounce of realism can save an infinity of states, in: Proceedings of Computer Science Logic, Lecture Notes in Computer Science, vol. 1683, Springer, Berlin, 1999, pp. 126-140.
12. M. Fränzle, What will be eventually true of polynomial hybrid automata, in: Proceedings of Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, vol. 2215, Springer, Berlin, 2001, pp. 340-359. (Pubitemid 33359700)
13. T. A. Henzinger, P. H. Ho, H. Wong-Toi, Algorithmic analysis of nonlinear hybrid systems, IEEE Trans. Automat. Contr. 43 (4) (1998) 540-554. (Pubitemid 128737377)
14. T. A. Henzinger, P. W. Kopke, A. Puri, P. Varaiya, What's decidable about hybrid automata?, J. Comput. Syst. Sci. 57 (1) (1998) 94-124. (Pubitemid 128428160)
15. T. A. Henzinger, R. Majumdar, Symbolic model checking for rectangular hybrid systems, in: Proceedings of Tools and Algorithms for Construction and Analysis of Systems, Lecture Notes in Computer Science, vol. 1785, Springer, Berlin, 2000, pp. 142-156.
16. A. B. Kurzhanski, P. Varaiya, Reachability under uncertainty, in: Proceedings of IEEE Conference on Decision and Control, IEEE Computer Society Press, Los Alamitos, 2002, pp. 1982-1987.
17. G. Lafferriere, G. J. Pappas, S. Sastry, O-Minimal hybrid systems, Math. Contr. Sign. Syst. 13 (1) (2000) 1-21. (Pubitemid 30578622)
18. G. Lafferriere, G. J. Pappas, S. Yovine, A new class of decidable hybrid systems, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 1569, Springer, Berlin, 1999, pp. 137-151.
19. G. Lafferriere, G. J. Pappas, S. Yovine, Reachability computation for linear hybrid systems, in: Proc. IFAC World Congress, 1999, pp. 7-12.
20. R. Lanotte, S. Tini, Taylor approximation for hybrid systems, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 3114, Springer, Berlin, 1999, pp. 402-416.
21. I. Mitchell, A. M. Bayen, C. J. Tomlin, Validating a Hamilton-Jacobi approximation to hybrid system reachable sets, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 2034, Springer, Berlin, 2001, pp. 418-432. (Pubitemid 33256434)
22. V. Mysore, B. Mishra, Algorithmic algebraic model checking III: approximated methods, in: Proceedings of Verification of Infinite-State Systems, Electronic Notes in Theoretical Computer Science, vol. 149 (1), Elsevier, Amsterdam, 2006, pp. 61-77. (Pubitemid 43131444)
23. V. Mysore, C. Piazza, B. Mishra, Algorithmic algebraic model checking II: decidability of semi-algebraic model checking and its applications to system biology, in: Proceedings of Automated Technology for Verification and Analysis, Lecture Notes in Computer Science, vol. 3707, Springer, Berlin, 2005, pp. 217-233.
24. C. Piazza, M. Antoniotti, V. Mysore, A. Policriti, F. Winkler, B. Mishra, Algorithmic algebraic model checking I: challenges from systems biology, in: Proceedings of Computer Aided Verification, Lecture Notes in Computer Science, vol. 3576, Springer, Berlin, 2005, pp. 5-19. (Pubitemid 41431716)
25. A. Pnueli, J. Sifakis (Eds.), Special issue on hybrid systems, Theor. Comput. Sci. 138 (1) (1995).
26. A. Puri, V. Borkar, P. Varaiya, ε-Approximation of differential inclusions, in: Proceedings of Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 1066, Springer, Berlin, 1996, pp. 362-376.
27. S. Ratschan, Z. She, Safety verification of hybrid systems by constraint propagation based abstraction refinement, ACM Trans. Embedded Comput. Syst. 6 (1) (2007).
28. Redlog home page. .
29. A. Tarski, ADecision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, California, 1951.
30. A. Tiwari, Abstractions for hybrid systems, submitted for publication. Available from: .
31. C. Tomlin, I. Mitchell, A. Bayen, M. Oishi, Computational techniques for the verification and control of hybrid systems, Proc. IEEE 91 (7) (2003) 986-1001. (Pubitemid 40890836)
32. H. Yazarel, G. J. Pappas, Geometric programming relaxations for non linear system reachability, in: Proc. American Control Conference, 2004.