Extending timed automata for compositional modeling healthy timed systems
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 syntactically-checkable "I/O compatibility"...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2002 |
| País: | Argentina |
| Institución: | Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales |
| Repositorio: | Biblioteca Digital (UBA-FCEN) |
| Idioma: | inglés |
| OAI Identifier: | paperaa:paper_15710661_v52_n3_p227_Braberman |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15710661_v52_n3_p227_Braberman |
| Access Level: | acceso abierto |
| Palabra clave: | Automata theory Mathematical models Statistical methods Compositional modeling Key modeling Timed Automata Computer programming languages |
| Sumario: | 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 syntactically-checkable "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. © 2002 Published by Elsevier Science B. V. |
|---|