Algorithmic analysis of nonlinear hybrid systems

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

Volumn 939, Issue , 1995, Pages 225-238

  Henzinger, Thomas A ^a   Ho, Pei Hsin ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; COMPUTER AIDED ANALYSIS; EMBEDDED SYSTEMS; HYBRID SYSTEMS; LINEAR SYSTEMS; MODEL CHECKING; PIECEWISE LINEAR TECHNIQUES; PROGRAM TRANSLATORS;

ALGORITHMIC ANALYSIS; CONTINUOUS VARIABLES; LINEAR HYBRID SYSTEMS; NON-LINEAR TEMPERATURE CONTROL; NONLINEAR ENVIRONMENTS; NONLINEAR HYBRID SYSTEMS; PIECEWISE LINEAR TRAJECTORY; SYMBOLIC MODEL CHECKERS;

NONLINEAR ANALYSIS;

EID: 84947944522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60045-0_53     Document Type: Conference Paper

References (12)

1. R. Alur, C. Coucoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
2. R. Alur, C. Courcoubetis, T.A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. Hybrid Systems, Lecture Notes in Computer Science 736, pp. 209-229. Springer, 1993.
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
4. R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Real-time Systems Symposium, pp. 2-11, 1993.
5. 20 states and beyond. Information and Computation, 98(2):142-170, 1992.
6. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. ACM Symposium on Principles of Programming Languages, 1977.
7. R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors. Hybrid Systems. Lecture Notes in Computer Science 736. Springer, 1993.
8. T.A. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? ACM Symposium on Theory of Computing, 1995.
9. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
10. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. Hybrid Systems, Lecture Notes in Computer Science 736, pp. 149-178. Springer, 1993.
11. A. Olivero, J. Sifakis, and S. Yovine. Using abstractions for the verification of linear hybrid systems. CAV 94: Computer-aided Verification, Lecture Notes in Computer Science 818, pp. 81-94. Springer, 1994.
12. A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. CAV 94: Computer-aided Verification, Lecture Notes in Computer Science 818, pp. 95-104. Springer, 1994.