Compositional action system refinement
We show how a parallel composition of action systems can be refined by refining the components separately, and checking non-interference against invariants and guarantee conditions, which are abstract and stable. The guarantee condition can be thought of as a very abstract specification of how a sys...
Gespeichert in:
| Veröffentlicht in: | Formal aspects of computing 2003-11, Vol.15 (2-3), p.103-117 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 117 |
|---|---|
| container_issue | 2-3 |
| container_start_page | 103 |
| container_title | Formal aspects of computing |
| container_volume | 15 |
| creator | BACK, R. J. R VON WRIGHT, J |
| description | We show how a parallel composition of action systems can be refined by refining the components separately, and checking non-interference against invariants and guarantee conditions, which are abstract and stable. The guarantee condition can be thought of as a very abstract specification of how a system affects the global state, and it allows us to show that an action system refinement is valid in a given environment, even if we do not know any of the details of that environment. The paper extends the traditional notion of action systems slightly, and it makes use of a generalisation of the attribute model for program variables. |
| doi_str_mv | 10.1007/s00165-003-0005-6 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_203571056</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>682304501</sourcerecordid><originalsourceid>FETCH-LOGICAL-c215t-f7c2b6df4cf55a8540d2f02fb7f5ac29536cf14be07f88c9bc67db38e55cea5c3</originalsourceid><addsrcrecordid>eNpFkEtLxEAQhAdRcF39Ad6CoLfRnkfncZTFFyx4UfA2TDozkGWTrNPZw_57E3bBQ1N9qCqKT4hbBY8KoHhiAJWjBDDTAcr8TCyUNUbqqvo5FwuojJUI1lyKK-bN5MZKqYV4WA3dbuB2bIfebzNP85PxgcfQZSnEtg9d6MdrcRH9lsPNSZfi-_Xla_Uu159vH6vntSStcJSxIF3nTbQUEX2JFhodQce6iOhJV2hyisrWAYpYllTVlBdNbcqASMEjmaW4O_bu0vC7Dzy6zbBP0zJ2GgwWCjCfTOpoojQwTyPdLrWdTwenwM003JGGm2i4mYabM_enYs_ktzH5nlr-D6JBNNqaP1BqXys</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>203571056</pqid></control><display><type>article</type><title>Compositional action system refinement</title><source>EZB Electronic Journals Library</source><source>SpringerLink Journals - AutoHoldings</source><creator>BACK, R. J. R ; VON WRIGHT, J</creator><creatorcontrib>BACK, R. J. R ; VON WRIGHT, J</creatorcontrib><description>We show how a parallel composition of action systems can be refined by refining the components separately, and checking non-interference against invariants and guarantee conditions, which are abstract and stable. The guarantee condition can be thought of as a very abstract specification of how a system affects the global state, and it allows us to show that an action system refinement is valid in a given environment, even if we do not know any of the details of that environment. The paper extends the traditional notion of action systems slightly, and it makes use of a generalisation of the attribute model for program variables.</description><identifier>ISSN: 0934-5043</identifier><identifier>EISSN: 1433-299X</identifier><identifier>DOI: 10.1007/s00165-003-0005-6</identifier><identifier>CODEN: FACME5</identifier><language>eng</language><publisher>London: Springer</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Logic and foundations ; Mathematical logic, foundations, set theory ; Mathematics ; Programming languages ; Programming theory ; Proof theory and constructive mathematics ; Sciences and techniques of general use ; Software ; Theoretical computing</subject><ispartof>Formal aspects of computing, 2003-11, Vol.15 (2-3), p.103-117</ispartof><rights>2004 INIST-CNRS</rights><rights>Copyright Springer-Verlag 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c215t-f7c2b6df4cf55a8540d2f02fb7f5ac29536cf14be07f88c9bc67db38e55cea5c3</citedby><cites>FETCH-LOGICAL-c215t-f7c2b6df4cf55a8540d2f02fb7f5ac29536cf14be07f88c9bc67db38e55cea5c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,776,780,785,786,23909,23910,25118,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15355324$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>BACK, R. J. R</creatorcontrib><creatorcontrib>VON WRIGHT, J</creatorcontrib><title>Compositional action system refinement</title><title>Formal aspects of computing</title><description>We show how a parallel composition of action systems can be refined by refining the components separately, and checking non-interference against invariants and guarantee conditions, which are abstract and stable. The guarantee condition can be thought of as a very abstract specification of how a system affects the global state, and it allows us to show that an action system refinement is valid in a given environment, even if we do not know any of the details of that environment. The paper extends the traditional notion of action systems slightly, and it makes use of a generalisation of the attribute model for program variables.</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>Logic and foundations</subject><subject>Mathematical logic, foundations, set theory</subject><subject>Mathematics</subject><subject>Programming languages</subject><subject>Programming theory</subject><subject>Proof theory and constructive mathematics</subject><subject>Sciences and techniques of general use</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0934-5043</issn><issn>1433-299X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpFkEtLxEAQhAdRcF39Ad6CoLfRnkfncZTFFyx4UfA2TDozkGWTrNPZw_57E3bBQ1N9qCqKT4hbBY8KoHhiAJWjBDDTAcr8TCyUNUbqqvo5FwuojJUI1lyKK-bN5MZKqYV4WA3dbuB2bIfebzNP85PxgcfQZSnEtg9d6MdrcRH9lsPNSZfi-_Xla_Uu159vH6vntSStcJSxIF3nTbQUEX2JFhodQce6iOhJV2hyisrWAYpYllTVlBdNbcqASMEjmaW4O_bu0vC7Dzy6zbBP0zJ2GgwWCjCfTOpoojQwTyPdLrWdTwenwM003JGGm2i4mYabM_enYs_ktzH5nlr-D6JBNNqaP1BqXys</recordid><startdate>200311</startdate><enddate>200311</enddate><creator>BACK, R. J. R</creator><creator>VON WRIGHT, J</creator><general>Springer</general><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>200311</creationdate><title>Compositional action system refinement</title><author>BACK, R. J. R ; VON WRIGHT, J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c215t-f7c2b6df4cf55a8540d2f02fb7f5ac29536cf14be07f88c9bc67db38e55cea5c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</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>Logic and foundations</topic><topic>Mathematical logic, foundations, set theory</topic><topic>Mathematics</topic><topic>Programming languages</topic><topic>Programming theory</topic><topic>Proof theory and constructive mathematics</topic><topic>Sciences and techniques of general use</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>BACK, R. J. R</creatorcontrib><creatorcontrib>VON WRIGHT, J</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Formal aspects of computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>BACK, R. J. R</au><au>VON WRIGHT, J</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Compositional action system refinement</atitle><jtitle>Formal aspects of computing</jtitle><date>2003-11</date><risdate>2003</risdate><volume>15</volume><issue>2-3</issue><spage>103</spage><epage>117</epage><pages>103-117</pages><issn>0934-5043</issn><eissn>1433-299X</eissn><coden>FACME5</coden><abstract>We show how a parallel composition of action systems can be refined by refining the components separately, and checking non-interference against invariants and guarantee conditions, which are abstract and stable. The guarantee condition can be thought of as a very abstract specification of how a system affects the global state, and it allows us to show that an action system refinement is valid in a given environment, even if we do not know any of the details of that environment. The paper extends the traditional notion of action systems slightly, and it makes use of a generalisation of the attribute model for program variables.</abstract><cop>London</cop><pub>Springer</pub><doi>10.1007/s00165-003-0005-6</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0934-5043 |
| ispartof | Formal aspects of computing, 2003-11, Vol.15 (2-3), p.103-117 |
| issn | 0934-5043 1433-299X |
| language | eng |
| recordid | cdi_proquest_journals_203571056 |
| source | EZB Electronic Journals Library; SpringerLink Journals - AutoHoldings |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Logic and foundations Mathematical logic, foundations, set theory Mathematics Programming languages Programming theory Proof theory and constructive mathematics Sciences and techniques of general use Software Theoretical computing |
| title | Compositional action system refinement |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T12%3A17%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Compositional%20action%20system%20refinement&rft.jtitle=Formal%20aspects%20of%20computing&rft.au=BACK,%20R.%20J.%20R&rft.date=2003-11&rft.volume=15&rft.issue=2-3&rft.spage=103&rft.epage=117&rft.pages=103-117&rft.issn=0934-5043&rft.eissn=1433-299X&rft.coden=FACME5&rft_id=info:doi/10.1007/s00165-003-0005-6&rft_dat=%3Cproquest_cross%3E682304501%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=203571056&rft_id=info:pmid/&rfr_iscdi=true |