Extending Timed Automata for Compositional Modeling Healthy Timed Systems
✍ Scribed by Víctor Braberman; Alfredo Olivero
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 382 KB
- Volume
- 52
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
✦ Synopsis
We introduce the notion of Timed I/O Components as Timed Automata "à la" Alur & Dill where an "admissible" I/O interface is declared. That notion has, what we consider, a key modeling property: non-zeno preservation under syntacticallycheckable "I/O compatibility" among interacting components. Also a reduced parallel composition is posssible based on the ability of statically detect influence of behavior between components ([8,10,11]). On the other hand, with some simple extra conditions, modular assume-guarantee style of reasoning like ([15,19]) is valid in our model.
📜 SIMILAR VOLUMES
A new model is presented to describe data-flow algorithms implemented in a multiprocessing system. Called the resource/data flow graph (RDFG), the model explicitly represents cyclo-statie processor schedules as circuits of processor ares that reflect the order that processors execute graph nodes. Th