Skip to main content
SpringerLink
Log in

A class of rectangular hybrid systems with computable reach set

  • Conference paper
  • First Online:
Hybrid Systems IV (HS 1996)

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

Included in the following conference series:

Abstract

A class of rectangular hybrid systems is presented whose reach set is computable. The class is specified in terms of a controllability condition. That condition can be verified.

Research supported by NSF Grant ECS9417370 and ARO Contract DAAH04-94-G-0026.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, L. Fix and T.A. Henzinger. A Determinizable Class of Timed Automata. Proc. 6th Workshop Computer-Aided Verification 1994, LNCS 818, Springer-Verlag, 1994. pp. 1–13.

    Google Scholar 

  2. A. Olivero, J. Sifakis and S. Yovine. Using Abstractions for the Verification of Linear Hybrid Systems. Proc. 6th Workshop Computer-Aided Verification 1994, LNCS 818, Springer-Verlag, 1994. pp. 81–94.

    Google Scholar 

  3. A. Puri and P. Varaiya. Decidability of Hybrid Systems with Rectangular Differential Inclusions. Proc. 6th Workshop Computer-Aided Verification 1994, LNCS 818, Springer-Verlag, 1994. pp. 95–104.

    Google Scholar 

  4. T.A. Henzinger, P. Kopka, A. Puri and P. Varaiya. What's decidable about hybrid automata?. STOCS, 1995.

    Google Scholar 

  5. A. Puri, V. Borkar and P. Varaiya. ε-approximation of differential inclusions. Hybrid Systems III. verification and control, LNCS 1066, Springer-Verlag, 1996.

    Google Scholar 

  6. A. Deshpande and P. Varaiya. Viable Control of Hybrid Systems. Hybrid Systems II, Springer-Verlag, 1995. pp. 128–147.

    Google Scholar 

  7. M. Kourjanski and P. Varaiya. Stability of Hybrid Systems. Hybrid Systems III. verification and control, LNCS 1066, Springer-Verlag, 1996. pp. 413–423.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of California, 94720, Berkeley, CA

    Mikhail Kourjanski & Pravin Varaiya

Authors
  1. Mikhail Kourjanski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pravin Varaiya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Panos Antsaklis Wolf Kohn Anil Nerode Shankar Sastry

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kourjanski, M., Varaiya, P. (1997). A class of rectangular hybrid systems with computable reach set. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds) Hybrid Systems IV. HS 1996. Lecture Notes in Computer Science, vol 1273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031563

Download citation

  • DOI: https://doi.org/10.1007/BFb0031563

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63358-7

  • Online ISBN: 978-3-540-69523-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation