| G.J. Pappas and S. Sastry, Straightening out rectangular differential inclusions, to appear in System and Control Letters, 1998. |
....fact that the precursor operation for determining X may not converge. In particular, it was implied in [31] that the decidability boundary for hybrid systems may well rest with rectangular hybrid automata and therefore it was important to see how useful that class of systems would prove to be. In [36], it was suggested that the flow box theorem could be used to straighten out hybrid systems represented by nonlinear differential inclusions into rectangular hybrid automata. The necessary conditions for this transformation, however, were so restrictive that it was apparent that rectangular hybrid ....
G.J. Pappas and S. Sastry, Straightening out rectangular differential inclusions, to appear in System and Control Letters, 1998.
....negative results associated with the decidability of problems frame as finite automata. It appears that decidability results for hybrid automata (Puri and Varaiya, 1994) restrict the class of decidable systems to a rather specialized set. Recent attempts to transform linear systems to this form (Pappas and Sastry, 1997) seem to suggest that these forms are too restrictive for general hybrid systems. We therefore see that while providing an initial tool for the design and analysis of hybrid systems, automata based methods for hybrid modeling have an intrinsic limitation when dealing with highly concurrent ....
Pappas, George J. and Shankar Sastry (1997). Straightening out rectangular differential inclusions.
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