Extending timed automata for compositional modeling healthy timed systems

Autores
Braberman, V.; Olivero, A.
Año de publicación
2002
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil:Braberman, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fuente
Electron. Notes Theor. Comput. Sci. 2002;52(3):227-245
Materia
Automata theory
Mathematical models
Statistical methods
Compositional modeling
Key modeling
Timed Automata
Computer programming languages
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_15710661_v52_n3_p227_Braberman
Acceder
id BDUBAFCEN_0bddf6c9f00d7953140858d06da691dc
oai_identifier_str paperaa:paper_15710661_v52_n3_p227_Braberman
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling Extending timed automata for compositional modeling healthy timed systemsBraberman, V.Olivero, A.Automata theoryMathematical modelsStatistical methodsCompositional modelingKey modelingTimed AutomataComputer programming languagesWe 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.Fil:Braberman, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.2002info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_15710661_v52_n3_p227_BrabermanElectron. Notes Theor. Comput. Sci. 2002;52(3):227-245reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-09-29T13:42:49Zpaperaa:paper_15710661_v52_n3_p227_BrabermanInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-09-29 13:42:50.782Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv Extending timed automata for compositional modeling healthy timed systems
title Extending timed automata for compositional modeling healthy timed systems
spellingShingle Extending timed automata for compositional modeling healthy timed systems
Braberman, V.
Automata theory
Mathematical models
Statistical methods
Compositional modeling
Key modeling
Timed Automata
Computer programming languages
title_short Extending timed automata for compositional modeling healthy timed systems
title_full Extending timed automata for compositional modeling healthy timed systems
title_fullStr Extending timed automata for compositional modeling healthy timed systems
title_full_unstemmed Extending timed automata for compositional modeling healthy timed systems
title_sort Extending timed automata for compositional modeling healthy timed systems
dc.creator.none.fl_str_mv Braberman, V.
Olivero, A.
author Braberman, V.
author_facet Braberman, V.
Olivero, A.
author_role author
author2 Olivero, A.
author2_role author
dc.subject.none.fl_str_mv Automata theory
Mathematical models
Statistical methods
Compositional modeling
Key modeling
Timed Automata
Computer programming languages
topic Automata theory
Mathematical models
Statistical methods
Compositional modeling
Key modeling
Timed Automata
Computer programming languages
dc.description.none.fl_txt_mv 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.
Fil:Braberman, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
description 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.
publishDate 2002
dc.date.none.fl_str_mv 2002
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12110/paper_15710661_v52_n3_p227_Braberman
url http://hdl.handle.net/20.500.12110/paper_15710661_v52_n3_p227_Braberman
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv Electron. Notes Theor. Comput. Sci. 2002;52(3):227-245
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1844618733247528960
score 13.070432

Publicaciones similares