Loading...
Please wait, while we are loading the content...
Similar Documents
Discrete-Time Re nement of Hybrid Automata ?
| Content Provider | Semantic Scholar |
|---|---|
| Author | Thomas Stauner B. M. W. |
| Copyright Year | 2007 |
| Abstract | Notations like hybrid automata are highly useful in the development process of hybrid systems to document requirements in early design steps. When it comes to implementation a part of the requirements will be realized in software in a discrete-time manner. We therefore study suucient conditions which ensure that an automaton operating in discrete-time reenes a hybrid automaton with its underlying continuous time model. Our notion of reenement provides that vital properties which have been established for the hybrid automaton also hold for its reene-ment. Furthermore, we outline a method how to derive a discrete-time reenement from a hybrid automaton. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www4.informatik.tu-muenchen.de/~stauner/papers/hscc02.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |