On the decidability of the reachability problem for planar differential inclusions

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

Volumn 2034, Issue , 2001, Pages 89-104

  Asarin, Eugene ^a   Schneider, Gerardo ^a   Yovine, Sergio ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIAL EQUATIONS; HYBRID SYSTEMS;

ALGORITHM FOR SOLVING; ARBITRARY TRAJECTORIES; DECISION PROCEDURE; DIFFERENTIAL INCLUSIONS; PIECE-WISE; REACHABILITY PROBLEM; SELF-CROSSING; SIMPLE MODELING;

TRAJECTORIES;

EID: 33750348353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45351-2_11     Document Type: Conference Paper

References (16)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. TCS 138 (1995) 3-34.
2. R. Alur and D.L. Dill. A theory of timed automata. TCS 126 (1994) 183-235.
3. E. Asarin, O. Bournez, T. Dang, and O. Maler. Reachability analysis of piecewiselinear dynamical systems. In HSCC'00, 20-31. LNCS 1790, Springer Verlag, 2000.
4. E. Asarin, O. Maler, and A. Pnueli. On the analysis of dynamical systems having piecewise-constant derivatives. TCS, 138 (1995) 35-65.
5. E. Asarin, G. Schneider and S. Yovine. On the Decidability of the Reachability Problem for Planar Differential Inclusions. VERIMAG Technical Report. 2001. http://www-verimag.imag.fr/_gerardo.
6. O. Botchkarev and S. Tripakis. Verification of hybrid systems with linear differential inclusions using ellipsoidal approximations. In HSCC'00. LNCS 1790, Springer Verlag, 2000.
7. M. Broucke. A geometric approach to bisimulation and verification of hybrid systems. In HSCC'99. LNCS 1569, Springer Verlag, 1999.
8. K. Cerans and J. Vksna. Deciding reachability for planar multi-polynomial systems. In Hybrid Systems III. LNCS 1066, Springer Verlag, 1996.
9. T. Dang and O. Maler. Reachability analysis via face lifting. In HSCC'98, 96-109. LNCS 1386, Springer Verlag, 1998.
10. J. Della Dora and S. Yovine. Looking for a methodology for analyzing hybrid systems. Submitted to ECC 2001, 2000.
11. M. R. Greenstreet and I. Mitchell. Reachability analysis using polygonal projections. In HSCC'99. LNCS 1569, 103-116. Springer Verlag, 1999.
12. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In 27th Annual Symposium on Theory of Computing, 373-382. ACM Press, 1995.
13. P. Koiran. My favourite problems. http://www.ens-lyon.fr/~koiran/problems.html.
14. A.B. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In HSCC'00. LNCS 1790, Springer Verlag, 2000.
15. G. Laerriere, G. J. Pappas, and S. Yovine. A new class of decidable hybrid systems. In HSCC'99. LNCS 1569, 137-151. Springer Verlag, 1999.
16. O. Maler and A. Pnueli. Reachability analysis of planar multi-linear systems. In CAV'93. LNCS 697, 194-209. Springer Verlag, 1993.