• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

The Theory of Hybrid Automata (1996)

Cached

  • Download as a PDF

Download Links

  • [www.eecs.berkeley.edu]
  • [www.ee.ntu.edu.tw]
  • [www.eecs.berkeley.edu]
  • [www.ics.uci.edu]
  • [www-cad.eecs.berkeley.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Thomas A. Henzinger
Citations:681 - 12 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Henzinger96thetheory,
    author = {Thomas A. Henzinger},
    title = {The Theory of Hybrid Automata},
    booktitle = {},
    year = {1996},
    pages = {278--292},
    publisher = {IEEE Computer Society Press}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various model-checking techniques that were originally developed for finite-state systems.

Keyphrases

hybrid automaton    finitary trace equivalence    finite-state system    uncountable state space    various class    discrete state space    formal model    various model-checking technique    mixed discrete-continuous system    mixed discrete-continuous state space   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University