Skip to main content

Some remarks about flows in hybrid systems

  • Conference paper
  • First Online:
Hybrid Systems (HS 1992, HS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 736))

Abstract

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.

This research was supported in part by NASA grant NAG2-513 and NSF grant DMS 910-1089.

This research is supported in part by NSF grant DMS 910-1089.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. Z. Bartosiewicz, “Minimal Polynomial Realizations,” Mathematics of Control, Signals, and Systems, Volume 1, pp. 227–237, 1988.

    Google Scholar 

  3. J. Glimm and A. Jaffe, Quantum Physics: A Functional Integral Point of View, Springer-Verlag, New York, 1981.

    Google Scholar 

  4. R. L. Grossman, “Path planning, persistent stores, and hybrid systems,” submitted for publication.

    Google Scholar 

  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. 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. R. L. Grossman and R. G. Larson, “A bialgebra approach to hybrid systems, submitted for publication.

    Google Scholar 

  8. R. L. Grossman and R. G. Larson, “Hybrid systems as free products of bialgebras, in preparation.

    Google Scholar 

  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. W. Kohn, “Declarative control theory,” AIAA GN & D Journal, February, 1989.

    Google Scholar 

  11. W. Kohn and A. Nerode, “Models for hybrid sysems: Automata, topologies and stability,” submitted for publication.

    Google Scholar 

  12. M. E. Sweedler, Hopf algebras, W. A. Benjamin, New York, 1969.

    Google Scholar 

  13. E. D. Sontag, Polynomial Response Maps, Lecture Notes in Control and Information Sciences, Volume 13, Springer-Verlag, New York, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robert L. Grossman Anil Nerode Anders P. Ravn Hans Rischel

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grossman, R.L., Larson, R.G. (1993). Some remarks about flows in hybrid systems. In: Grossman, R.L., Nerode, A., Ravn, A.P., Rischel, H. (eds) Hybrid Systems. HS HS 1992 1991. Lecture Notes in Computer Science, vol 736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57318-6_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-57318-6_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57318-0

  • Online ISBN: 978-3-540-48060-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics