Reconfiguration of software architecture styles with name mobility
An important issue in the area of software architecture is the specification of reconfiguration and mobility of systems. This paper presents an approach for the specification of software architecture styles using hyperedge replacement systems and for their dynamic reconfiguration using constraint so...
Guardado en:
| Publicado: |
2000
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v1906_n_p148_Hirsch http://hdl.handle.net/20.500.12110/paper_03029743_v1906_n_p148_Hirsch |
| Aporte de: |
| id |
paper:paper_03029743_v1906_n_p148_Hirsch |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_03029743_v1906_n_p148_Hirsch2023-06-08T15:28:20Z Reconfiguration of software architecture styles with name mobility Calculations Codes (symbols) Computational linguistics Dynamic models Formal languages Logic programming Memory architecture Reconfigurable hardware Software architecture Specifications Complex evolutions Constraint Solving Dynamic evolution Dynamic re-configuration Graph rewriting Hyperedge replacement Software architecture style System architectures Graph theory An important issue in the area of software architecture is the specification of reconfiguration and mobility of systems. This paper presents an approach for the specification of software architecture styles using hyperedge replacement systems and for their dynamic reconfiguration using constraint solving. A system architecture is represented as a graph where edges are components and nodes are ports of communication. Then, a style is represented as a graph grammar where the instances of the style are the graphs generated by the corresponding grammar. The construction and dynamic evolution of the style are represented as context-free productions and graph rewriting. To modelreconfigurations we allow the declaration, creation and matching of new nodes (i.e. ports of communication) and use constraint solving over the productions of the style grammar for achieving synchronization. In this way complex evolutions can be specified in a more expressive and compact form than using π-calculus style languages for mobility. © Springer-Verlag Berlin Heidelberg 2000. 2000 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v1906_n_p148_Hirsch http://hdl.handle.net/20.500.12110/paper_03029743_v1906_n_p148_Hirsch |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Calculations Codes (symbols) Computational linguistics Dynamic models Formal languages Logic programming Memory architecture Reconfigurable hardware Software architecture Specifications Complex evolutions Constraint Solving Dynamic evolution Dynamic re-configuration Graph rewriting Hyperedge replacement Software architecture style System architectures Graph theory |
| spellingShingle |
Calculations Codes (symbols) Computational linguistics Dynamic models Formal languages Logic programming Memory architecture Reconfigurable hardware Software architecture Specifications Complex evolutions Constraint Solving Dynamic evolution Dynamic re-configuration Graph rewriting Hyperedge replacement Software architecture style System architectures Graph theory Reconfiguration of software architecture styles with name mobility |
| topic_facet |
Calculations Codes (symbols) Computational linguistics Dynamic models Formal languages Logic programming Memory architecture Reconfigurable hardware Software architecture Specifications Complex evolutions Constraint Solving Dynamic evolution Dynamic re-configuration Graph rewriting Hyperedge replacement Software architecture style System architectures Graph theory |
| description |
An important issue in the area of software architecture is the specification of reconfiguration and mobility of systems. This paper presents an approach for the specification of software architecture styles using hyperedge replacement systems and for their dynamic reconfiguration using constraint solving. A system architecture is represented as a graph where edges are components and nodes are ports of communication. Then, a style is represented as a graph grammar where the instances of the style are the graphs generated by the corresponding grammar. The construction and dynamic evolution of the style are represented as context-free productions and graph rewriting. To modelreconfigurations we allow the declaration, creation and matching of new nodes (i.e. ports of communication) and use constraint solving over the productions of the style grammar for achieving synchronization. In this way complex evolutions can be specified in a more expressive and compact form than using π-calculus style languages for mobility. © Springer-Verlag Berlin Heidelberg 2000. |
| title |
Reconfiguration of software architecture styles with name mobility |
| title_short |
Reconfiguration of software architecture styles with name mobility |
| title_full |
Reconfiguration of software architecture styles with name mobility |
| title_fullStr |
Reconfiguration of software architecture styles with name mobility |
| title_full_unstemmed |
Reconfiguration of software architecture styles with name mobility |
| title_sort |
reconfiguration of software architecture styles with name mobility |
| publishDate |
2000 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v1906_n_p148_Hirsch http://hdl.handle.net/20.500.12110/paper_03029743_v1906_n_p148_Hirsch |
| _version_ |
1768546208624672768 |