Abstract
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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - Real-Time Systems Symposium |
| Editors | Anon |
| Pages | 254-263 |
| Number of pages | 10 |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 19th IEEE Real-Time Systems Symposium - Madrid, Spain Duration: Dec 2 1998 → Dec 4 1998 |
Other
| Other | Proceedings of the 1998 19th IEEE Real-Time Systems Symposium |
|---|---|
| City | Madrid, Spain |
| Period | 12/2/98 → 12/4/98 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture