M. Greenstreet and I. Mitchell, \Reachability analysis using polynomial projections," in Hybrid systems: Computation and Control (F.W. Vaandrager and J.H. van Schuppen, eds.), vol. 1569 of Lecture Notes in Computer Science, Berlin, Germany: Springer, 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Approaches to Modelling, Analysis, and Control of.. - Boel, De Schutter.. (1999) (Correct)
....that solves the problem unless P = NP [23] which is generally assumed not to be the case. 2 A problem is undecidable if there cannot exist generally applicable algorithms that solve the problem. 3 good approximation, and for using such models to prove properties of general hybrid systems [4, 15, 16, 25, 45]. This approach will not be described further in this paper. It is also possible to approach hybrid systems by extending the state of a continuous system, represented by an ordinary di erential equation, with some variables belonging to a nite set. These logical variables may represent discrete ....
M. Greenstreet and I. Mitchell, \Reachability analysis using polynomial projections," in Hybrid systems: Computation and Control (F.W. Vaandrager and J.H. van Schuppen, eds.), vol. 1569 of Lecture Notes in Computer Science, Berlin, Germany: Springer, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC