Behavior-Preserving Refinement Relations Between Dynamic Software Architectures
In this paper, we address the refinement of abstract architectural models into more platform-specific representations. For each level of abstraction, we employ an architectural style covering structural restrictions on component configurations as well as supported communication and reconfiguration o...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 27 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Heckel, Reiko Thöne, Sebastian |
description | In this paper, we address the refinement of abstract architectural models into more platform-specific representations. For each level of abstraction, we employ an architectural style covering structural restrictions on component configurations as well as supported communication and reconfiguration operations. Architectural styles are formalized as graph transformation systems with graph transformation rules defining the available operations. Architectural models are given as graphs to which one can directly apply the transformation rules in order to simulate operations and their effects.
In addition to previous work, we include process descriptions into our architectural models in order to control the communication and reconfiguration behavior of the components. The execution semantics of these processes is also covered by graph transformation systems.
We propose a notion of refinement which requires the preservation of both structure and behavior at the lower level of abstraction. Based on formal refinement relationships between abstract and platform-specific styles, we can use model checking techniques to verify that abstract scenarios can also be realized in the platform-specific architecture. |
doi_str_mv | 10.1007/978-3-540-31959-7_1 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16896012</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16896012</sourcerecordid><originalsourceid>FETCH-LOGICAL-p227t-1d47e18acc87927aaaaed77bef7f86796bfded93b33068f62c55b3ce7eabc0f43</originalsourceid><addsrcrecordid>eNotkElvwjAQhd1NKqX8gl5y6dGtlyQTH4GuEhJVF6k3yzFjcAsJslMQ_74udC6zvDfv8BFyxdkNZwxuFVRU0iJnVHJVKAqaH5ELmQ77_fOY9HjJOZUyVycHQRRSADslPSaZoApyeU4GMX6xVOkJoOiR6QgXZuPbQF8CRgwb38yzV3S-wRU2XRqXpvNtE7MRdlvEJrvbNWblbfbWum5rAmbDYBe-Q9v9pIRLcubMMuLgv_fJx8P9-_iJTqaPz-PhhK6FgI7yWQ7IK2NtBUqASYUzgBoduKoEVdZuhjMlaylZWblS2KKopUVAU1vmctkn14fctYnWLF0wjfVRr4NfmbDTvKxUybhIPn7wxSQ1cwy6btvvqDnTf1h1wqqlTrD0HqNOWOUvHjdoRg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Behavior-Preserving Refinement Relations Between Dynamic Software Architectures</title><source>Springer Books</source><creator>Heckel, Reiko ; Thöne, Sebastian</creator><contributor>Orejas, Fernando ; Mosses, Peter D. ; Fiadeiro, José Luiz</contributor><creatorcontrib>Heckel, Reiko ; Thöne, Sebastian ; Orejas, Fernando ; Mosses, Peter D. ; Fiadeiro, José Luiz</creatorcontrib><description>In this paper, we address the refinement of abstract architectural models into more platform-specific representations. For each level of abstraction, we employ an architectural style covering structural restrictions on component configurations as well as supported communication and reconfiguration operations. Architectural styles are formalized as graph transformation systems with graph transformation rules defining the available operations. Architectural models are given as graphs to which one can directly apply the transformation rules in order to simulate operations and their effects.
In addition to previous work, we include process descriptions into our architectural models in order to control the communication and reconfiguration behavior of the components. The execution semantics of these processes is also covered by graph transformation systems.
We propose a notion of refinement which requires the preservation of both structure and behavior at the lower level of abstraction. Based on formal refinement relationships between abstract and platform-specific styles, we can use model checking techniques to verify that abstract scenarios can also be realized in the platform-specific architecture.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540253270</identifier><identifier>ISBN: 9783540253273</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 354031959X</identifier><identifier>EISBN: 9783540319597</identifier><identifier>DOI: 10.1007/978-3-540-31959-7_1</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Graph Grammar ; Graph Transformation ; Software Architecture ; Theoretical computing ; Transformation Rule ; Type Graph</subject><ispartof>Lecture notes in computer science, 2005, p.1-27</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-31959-7_1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-31959-7_1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16896012$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Orejas, Fernando</contributor><contributor>Mosses, Peter D.</contributor><contributor>Fiadeiro, José Luiz</contributor><creatorcontrib>Heckel, Reiko</creatorcontrib><creatorcontrib>Thöne, Sebastian</creatorcontrib><title>Behavior-Preserving Refinement Relations Between Dynamic Software Architectures</title><title>Lecture notes in computer science</title><description>In this paper, we address the refinement of abstract architectural models into more platform-specific representations. For each level of abstraction, we employ an architectural style covering structural restrictions on component configurations as well as supported communication and reconfiguration operations. Architectural styles are formalized as graph transformation systems with graph transformation rules defining the available operations. Architectural models are given as graphs to which one can directly apply the transformation rules in order to simulate operations and their effects.
In addition to previous work, we include process descriptions into our architectural models in order to control the communication and reconfiguration behavior of the components. The execution semantics of these processes is also covered by graph transformation systems.
We propose a notion of refinement which requires the preservation of both structure and behavior at the lower level of abstraction. Based on formal refinement relationships between abstract and platform-specific styles, we can use model checking techniques to verify that abstract scenarios can also be realized in the platform-specific architecture.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Graph Grammar</subject><subject>Graph Transformation</subject><subject>Software Architecture</subject><subject>Theoretical computing</subject><subject>Transformation Rule</subject><subject>Type Graph</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540253270</isbn><isbn>9783540253273</isbn><isbn>354031959X</isbn><isbn>9783540319597</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkElvwjAQhd1NKqX8gl5y6dGtlyQTH4GuEhJVF6k3yzFjcAsJslMQ_74udC6zvDfv8BFyxdkNZwxuFVRU0iJnVHJVKAqaH5ELmQ77_fOY9HjJOZUyVycHQRRSADslPSaZoApyeU4GMX6xVOkJoOiR6QgXZuPbQF8CRgwb38yzV3S-wRU2XRqXpvNtE7MRdlvEJrvbNWblbfbWum5rAmbDYBe-Q9v9pIRLcubMMuLgv_fJx8P9-_iJTqaPz-PhhK6FgI7yWQ7IK2NtBUqASYUzgBoduKoEVdZuhjMlaylZWblS2KKopUVAU1vmctkn14fctYnWLF0wjfVRr4NfmbDTvKxUybhIPn7wxSQ1cwy6btvvqDnTf1h1wqqlTrD0HqNOWOUvHjdoRg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Heckel, Reiko</creator><creator>Thöne, Sebastian</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Behavior-Preserving Refinement Relations Between Dynamic Software Architectures</title><author>Heckel, Reiko ; Thöne, Sebastian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p227t-1d47e18acc87927aaaaed77bef7f86796bfded93b33068f62c55b3ce7eabc0f43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Graph Grammar</topic><topic>Graph Transformation</topic><topic>Software Architecture</topic><topic>Theoretical computing</topic><topic>Transformation Rule</topic><topic>Type Graph</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Heckel, Reiko</creatorcontrib><creatorcontrib>Thöne, Sebastian</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Heckel, Reiko</au><au>Thöne, Sebastian</au><au>Orejas, Fernando</au><au>Mosses, Peter D.</au><au>Fiadeiro, José Luiz</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Behavior-Preserving Refinement Relations Between Dynamic Software Architectures</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>1</spage><epage>27</epage><pages>1-27</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540253270</isbn><isbn>9783540253273</isbn><eisbn>354031959X</eisbn><eisbn>9783540319597</eisbn><abstract>In this paper, we address the refinement of abstract architectural models into more platform-specific representations. For each level of abstraction, we employ an architectural style covering structural restrictions on component configurations as well as supported communication and reconfiguration operations. Architectural styles are formalized as graph transformation systems with graph transformation rules defining the available operations. Architectural models are given as graphs to which one can directly apply the transformation rules in order to simulate operations and their effects.
In addition to previous work, we include process descriptions into our architectural models in order to control the communication and reconfiguration behavior of the components. The execution semantics of these processes is also covered by graph transformation systems.
We propose a notion of refinement which requires the preservation of both structure and behavior at the lower level of abstraction. Based on formal refinement relationships between abstract and platform-specific styles, we can use model checking techniques to verify that abstract scenarios can also be realized in the platform-specific architecture.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-31959-7_1</doi><tpages>27</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2005, p.1-27 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_16896012 |
source | Springer Books |
subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Graph Grammar Graph Transformation Software Architecture Theoretical computing Transformation Rule Type Graph |
title | Behavior-Preserving Refinement Relations Between Dynamic Software Architectures |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T19%3A56%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Behavior-Preserving%20Refinement%20Relations%20Between%20Dynamic%20Software%20Architectures&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Heckel,%20Reiko&rft.date=2005&rft.spage=1&rft.epage=27&rft.pages=1-27&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540253270&rft.isbn_list=9783540253273&rft_id=info:doi/10.1007/978-3-540-31959-7_1&rft_dat=%3Cpascalfrancis_sprin%3E16896012%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=354031959X&rft.eisbn_list=9783540319597&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |