Skip to main content
SpringerLink
Log in

An Analysis of the Fuller Phenomenon on Transfinite Hybrid Automata

  • Conference paper
Hybrid Systems: Computation and Control (HSCC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5469))

Included in the following conference series:

Abstract

In this paper, we introduce the hybrid automaton on the discrete time structure of a countable scattered linear-order set and present the reachability analysis for the Zeno and reversed-Zeno behaviors in the Fuller’s phenomenon by using the extended automaton.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ames, A.D., Abate, A., Sastry, S.: Sufficient condition for the existence of Zeno behavior. In: 44th IEEE Conference on Decision and Control and Europian Control Conference (2005)

    Google Scholar 

  2. Bruyeŕe, V., Carton, O.: Automata on linear orderings. Journal of Computer and System Sciences 73(1), 1–24 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Nakamura, K., Fusaoka, A.: On Transfinite Hybrid Automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 495–510. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982) (A Subsidiary of Harcourt Brace Jovanovich, Publishers)

    MATH  Google Scholar 

  5. Zelikin, M.I., Borisov, V.F.: Theory of Chattering Control with applications to Astronautics, Robotics, Economics, and Engineering. Birkhaüser, Boston (1994)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ritsumeikan University, Nojihigashi, Kusatsu-city, SIGA, Japan, 525-8577

    Katsunori Nakamura

  2. Department of English Communication, Heian Jogakuin University, Nanpeidai, Takatsuki-city, OSAKA, Japan, 569-1092

    Katsunori Nakamura & Akira Fusaoka

Authors
  1. Katsunori Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akira Fusaoka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, 4531E Boelter Hall, CA 90095, Los Angeles, USA

    Rupak Majumdar

  2. Department of Electrical Engineering, University of California, 66-147F Engineering, IV Building, CA 90095-1594, Los Angeles, USA

    Paulo Tabuada

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nakamura, K., Fusaoka, A. (2009). An Analysis of the Fuller Phenomenon on Transfinite Hybrid Automata. In: Majumdar, R., Tabuada, P. (eds) Hybrid Systems: Computation and Control. HSCC 2009. Lecture Notes in Computer Science, vol 5469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00602-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00602-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00601-2

  • Online ISBN: 978-3-642-00602-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation