Hybrid Systems pp 357-365 | Cite as

Some remarks about flows in hybrid systems

  • R. L. Grossman
  • R. G. Larson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 736)


We consider hybrid systems as networks consisting of continuous input-output systems and discrete input-output automata. Some of the outputs may be connected to some of the inputs; the others server as the inputs and outputs of the hybrid system. We define a class of regular flows for such systems and make some remarks about them.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Z. Bartosiewicz, “Ordinary differential equations on real affine varieties,” Bulletin of the Polish Academy of Sciences: Mathematics, Volume 35, pp. 13–18, 1987.Google Scholar
  2. 2.
    Z. Bartosiewicz, “Minimal Polynomial Realizations,” Mathematics of Control, Signals, and Systems, Volume 1, pp. 227–237, 1988.Google Scholar
  3. 3.
    J. Glimm and A. Jaffe, Quantum Physics: A Functional Integral Point of View, Springer-Verlag, New York, 1981.Google Scholar
  4. 4.
    R. L. Grossman, “Path planning, persistent stores, and hybrid systems,” submitted for publication.Google Scholar
  5. 5.
    R. L. Grossman and R. G. Larson, “The realization of input-output maps using bialgebras, Forum Math., Volume 4, pp. 109–121, 1992.Google Scholar
  6. 6.
    R. L. Grossman and R. G. Larson, “Viewing hybrid systems as products of control systems and automata,” Proceedings of the 31st IEEE Conference on Decision and Control, IEEE Press, 1992.Google Scholar
  7. 7.
    R. L. Grossman and R. G. Larson, “A bialgebra approach to hybrid systems, submitted for publication.Google Scholar
  8. 8.
    R. L. Grossman and R. G. Larson, “Hybrid systems as free products of bialgebras, in preparation.Google Scholar
  9. 9.
    R. L. Grossman and D. E. Radford, “Bialgebra deformations of certain universal enveloping algebras,” Communications in Pure and Applied Algebra, to appear.Google Scholar
  10. 10.
    W. Kohn, “Declarative control theory,” AIAA GN & D Journal, February, 1989.Google Scholar
  11. 11.
    W. Kohn and A. Nerode, “Models for hybrid sysems: Automata, topologies and stability,” submitted for publication.Google Scholar
  12. 12.
    M. E. Sweedler, Hopf algebras, W. A. Benjamin, New York, 1969.Google Scholar
  13. 13.
    E. D. Sontag, Polynomial Response Maps, Lecture Notes in Control and Information Sciences, Volume 13, Springer-Verlag, New York, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • R. L. Grossman
    • 1
  • R. G. Larson
    • 1
  1. 1.Department of Mathematics, Statistics,& Computer Science (M/C 249)University of Illinois at ChicagoChicagoUSA

Personalised recommendations