Verification of XTP context management closing procedure in style of TLA
Modular specification and compositional verification of the context management closing procedure of Xpress Transfer Protocol (XTP Protocol Definition, Revision 3.6) in style of Lamport's Temporal Logic of Actions is considered. It is assumed that a full-duplex association over a pair of lossy c...
Gespeichert in:
Veröffentlicht in: | Science of computer programming 1997, Vol.29 (1), p.23-52 |
---|---|
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 | 52 |
---|---|
container_issue | 1 |
container_start_page | 23 |
container_title | Science of computer programming |
container_volume | 29 |
creator | Kapus, Tatjana Brezočnik, Zmago |
description | Modular specification and compositional verification of the context management closing procedure of Xpress Transfer Protocol (XTP Protocol Definition, Revision 3.6) in style of Lamport's Temporal Logic of Actions is considered. It is assumed that a full-duplex association over a pair of lossy channels between two contexts on different hosts is being closed, such that any data for that connection have already been transmitted successfully to the hosts. Thus, the case of the closing procedure is considered where both contexts are active and synchronized initially, and only control messages have to be sent until the association is closed. |
doi_str_mv | 10.1016/S0167-6423(96)00028-7 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27418592</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0167642396000287</els_id><sourcerecordid>27418592</sourcerecordid><originalsourceid>FETCH-LOGICAL-c286t-f5d9968e789a71dcb07ecc6b844a32c612df645b76086e106d9956ea008a3a013</originalsourceid><addsrcrecordid>eNqFkMFKAzEQhoMoWKuPIOQkelhNsrtJ9iSlqBUKClbxFtLsbIlsk5qkYt_etBWvXmYu3_8z8yF0Tsk1JZTfvOQhCl6x8rLhV4QQJgtxgAZUClaIhleHaPCHHKOTGD8yxCtBB2jyBsF21uhkvcO-w--zZ2y8S_Cd8FI7vYAluIRN76N1C7wK3kC7DoCtwzFtetiGZtPRKTrqdB_h7HcP0ev93Ww8KaZPD4_j0bQwTPJUdHXbNFyCkI0WtDVzIsAYPpdVpUtmOGVtx6t6LjiRHCjhGa85aEKkLjWh5RBd7HvzJZ9riEktbTTQ99qBX0fFREVl3bAM1nvQBB9jgE6tgl3qsFGUqK03tfOmtlJUw9XOmxI5d7vPQf7iy0JQ0Vhw-WsbwCTVevtPww9t5HQr</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27418592</pqid></control><display><type>article</type><title>Verification of XTP context management closing procedure in style of TLA</title><source>Elsevier ScienceDirect Journals Complete</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Kapus, Tatjana ; Brezočnik, Zmago</creator><creatorcontrib>Kapus, Tatjana ; Brezočnik, Zmago</creatorcontrib><description>Modular specification and compositional verification of the context management closing procedure of Xpress Transfer Protocol (XTP Protocol Definition, Revision 3.6) in style of Lamport's Temporal Logic of Actions is considered. It is assumed that a full-duplex association over a pair of lossy channels between two contexts on different hosts is being closed, such that any data for that connection have already been transmitted successfully to the hosts. Thus, the case of the closing procedure is considered where both contexts are active and synchronized initially, and only control messages have to be sent until the association is closed.</description><identifier>ISSN: 0167-6423</identifier><identifier>EISSN: 1872-7964</identifier><identifier>DOI: 10.1016/S0167-6423(96)00028-7</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Communication protocols ; Compositional verification ; Connection management ; Temporal logic of actions</subject><ispartof>Science of computer programming, 1997, Vol.29 (1), p.23-52</ispartof><rights>1997</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c286t-f5d9968e789a71dcb07ecc6b844a32c612df645b76086e106d9956ea008a3a013</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0167642396000287$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3537,4010,27900,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Kapus, Tatjana</creatorcontrib><creatorcontrib>Brezočnik, Zmago</creatorcontrib><title>Verification of XTP context management closing procedure in style of TLA</title><title>Science of computer programming</title><description>Modular specification and compositional verification of the context management closing procedure of Xpress Transfer Protocol (XTP Protocol Definition, Revision 3.6) in style of Lamport's Temporal Logic of Actions is considered. It is assumed that a full-duplex association over a pair of lossy channels between two contexts on different hosts is being closed, such that any data for that connection have already been transmitted successfully to the hosts. Thus, the case of the closing procedure is considered where both contexts are active and synchronized initially, and only control messages have to be sent until the association is closed.</description><subject>Communication protocols</subject><subject>Compositional verification</subject><subject>Connection management</subject><subject>Temporal logic of actions</subject><issn>0167-6423</issn><issn>1872-7964</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFkMFKAzEQhoMoWKuPIOQkelhNsrtJ9iSlqBUKClbxFtLsbIlsk5qkYt_etBWvXmYu3_8z8yF0Tsk1JZTfvOQhCl6x8rLhV4QQJgtxgAZUClaIhleHaPCHHKOTGD8yxCtBB2jyBsF21uhkvcO-w--zZ2y8S_Cd8FI7vYAluIRN76N1C7wK3kC7DoCtwzFtetiGZtPRKTrqdB_h7HcP0ev93Ww8KaZPD4_j0bQwTPJUdHXbNFyCkI0WtDVzIsAYPpdVpUtmOGVtx6t6LjiRHCjhGa85aEKkLjWh5RBd7HvzJZ9riEktbTTQ99qBX0fFREVl3bAM1nvQBB9jgE6tgl3qsFGUqK03tfOmtlJUw9XOmxI5d7vPQf7iy0JQ0Vhw-WsbwCTVevtPww9t5HQr</recordid><startdate>1997</startdate><enddate>1997</enddate><creator>Kapus, Tatjana</creator><creator>Brezočnik, Zmago</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1997</creationdate><title>Verification of XTP context management closing procedure in style of TLA</title><author>Kapus, Tatjana ; Brezočnik, Zmago</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c286t-f5d9968e789a71dcb07ecc6b844a32c612df645b76086e106d9956ea008a3a013</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Communication protocols</topic><topic>Compositional verification</topic><topic>Connection management</topic><topic>Temporal logic of actions</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kapus, Tatjana</creatorcontrib><creatorcontrib>Brezočnik, Zmago</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Science of computer programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kapus, Tatjana</au><au>Brezočnik, Zmago</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Verification of XTP context management closing procedure in style of TLA</atitle><jtitle>Science of computer programming</jtitle><date>1997</date><risdate>1997</risdate><volume>29</volume><issue>1</issue><spage>23</spage><epage>52</epage><pages>23-52</pages><issn>0167-6423</issn><eissn>1872-7964</eissn><abstract>Modular specification and compositional verification of the context management closing procedure of Xpress Transfer Protocol (XTP Protocol Definition, Revision 3.6) in style of Lamport's Temporal Logic of Actions is considered. It is assumed that a full-duplex association over a pair of lossy channels between two contexts on different hosts is being closed, such that any data for that connection have already been transmitted successfully to the hosts. Thus, the case of the closing procedure is considered where both contexts are active and synchronized initially, and only control messages have to be sent until the association is closed.</abstract><pub>Elsevier B.V</pub><doi>10.1016/S0167-6423(96)00028-7</doi><tpages>30</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0167-6423 |
ispartof | Science of computer programming, 1997, Vol.29 (1), p.23-52 |
issn | 0167-6423 1872-7964 |
language | eng |
recordid | cdi_proquest_miscellaneous_27418592 |
source | Elsevier ScienceDirect Journals Complete; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | Communication protocols Compositional verification Connection management Temporal logic of actions |
title | Verification of XTP context management closing procedure in style of TLA |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T17%3A13%3A55IST&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=Verification%20of%20XTP%20context%20management%20closing%20procedure%20in%20style%20of%20TLA&rft.jtitle=Science%20of%20computer%20programming&rft.au=Kapus,%20Tatjana&rft.date=1997&rft.volume=29&rft.issue=1&rft.spage=23&rft.epage=52&rft.pages=23-52&rft.issn=0167-6423&rft.eissn=1872-7964&rft_id=info:doi/10.1016/S0167-6423(96)00028-7&rft_dat=%3Cproquest_cross%3E27418592%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=27418592&rft_id=info:pmid/&rft_els_id=S0167642396000287&rfr_iscdi=true |