Membership questions for timed and hybrid automata

R. Alur, R. P. Kurshan, Mahesh Viswanathan

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. The membership problems for such automata were studied for effective error reporting and testing. Different types of membership problems were considered depending on whether the path, or the trace, or the timed trace is specified. The complexity of these membership problems for timed and linear hybrid automata, with and without ε-transitions is discussed.

Original languageEnglish (US)
Title of host publicationProceedings - Real-Time Systems Symposium
Editors Anon
Number of pages10
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 19th IEEE Real-Time Systems Symposium - Madrid, Spain
Duration: Dec 2 1998Dec 4 1998


OtherProceedings of the 1998 19th IEEE Real-Time Systems Symposium
CityMadrid, Spain

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture


Dive into the research topics of 'Membership questions for timed and hybrid automata'. Together they form a unique fingerprint.

Cite this