Deciding reachability for planar multi-polynomial systems

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

Volumn 1066, Issue , 1996, Pages 389-400

  Čerāns, Kārlis ^a   Vīksna, Juris ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; GEOMETRY; LINEAR SYSTEMS;

ARBITRARY DEGREE; DYNAMICAL BEHAVIOURS; EUCLIDEAN PLANES; POINT TO POINT; POLYNOMIAL SYSTEMS; REACHABILITY; REACHABILITY PROBLEM; VECTOR FIELDS;

HYBRID SYSTEMS;

EID: 84944214820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0020962     Document Type: Conference Paper

References (11)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.H. Ho, X. Nicollin, A. Olivero, J, Sifakis, and Y. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
2. R. Alur and D. Dill. Automata for modeling real time systems. In Proceedings of ICALP’90, volume 443 of Lecture Notes in Computer Science, pages 322-335, 1990.
3. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. E. Asarin and O. Maler. On some relations between dynamical systems and transition systems. In Proceedings of the 21st International Colloquium ICALP94, volume 820 of Lecture Notes in Computer Science, pages 59-72, 1994.
5. K. Čerans. Algorithmic problems in analysis of real time system specifications. PhD thesis, University of Latvia, 1992.
6. K. Čerans. Decidability of bisimulation equivalences for parallel timer processes. In Proceedings of CAV’92, volume 663 of Lecture Notes in Computer Science, pages 302-315, 1992.
7. P.A. Henzinger and P.H. Ho. Algorithmic analysis of nonlinear hybrid systems. In Proceedings of CAV’95, Lecture Notes in Computer Science, 1995.
8. T.A. Henzinger. Hybrid automata with finite bisimulations. In Proceedings of ICALP’95, volume 944 of Lecture Notes in Computer Science, pages 324-335, 1995.
9. T.A. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In Proceedings of the 27th ACM Symposium on Theory of Computing, 1995.
10. O. Maler and A. Pnueli. Reachability analysis of planar multi-linear systems. In Proceedings of the 5th International Conference of Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 194-209, 1993.
11. R. Zippel. Effective polynomial computation. Kluwer Academic Publishers, 1993.