Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions
Mixed-choice has long been barred from models of asynchronous communication since it compromises the decidability of key properties of communicating finite-state machines. Session types inherit this restriction, which precludes them from fully modelling timeouts -- a core property of web and cloud s...
Saved in:
| Published in: | Logical methods in computer science Vol. 21, Issue 3 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V
01.01.2025
|
| Subjects: | |
| ISSN: | 1860-5974, 1860-5974 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Mixed-choice has long been barred from models of asynchronous communication since it compromises the decidability of key properties of communicating finite-state machines. Session types inherit this restriction, which precludes them from fully modelling timeouts -- a core property of web and cloud services. To address this deficiency, we present (binary) Timeout Asynchronous Session Types (TOAST) as an extension to (binary) asynchronous timed session types, that permits mixed-choice. TOAST deploys timing constraints to regulate the use of mixed-choice so as to preserve communication safety. We provide a new behavioural semantics for TOAST which guarantees progress in the presence of mixed-choice. Building upon TOAST, we provide a calculus featuring process timers which is capable of modelling timeouts using a receive-after pattern, much like Erlang, and capture the correspondence with TOAST specifications via a type system for which we prove subject reduction. |
|---|---|
| AbstractList | Mixed-choice has long been barred from models of asynchronous communication since it compromises the decidability of key properties of communicating finite-state machines. Session types inherit this restriction, which precludes them from fully modelling timeouts -- a core property of web and cloud services. To address this deficiency, we present (binary) Timeout Asynchronous Session Types (TOAST) as an extension to (binary) asynchronous timed session types, that permits mixed-choice. TOAST deploys timing constraints to regulate the use of mixed-choice so as to preserve communication safety. We provide a new behavioural semantics for TOAST which guarantees progress in the presence of mixed-choice. Building upon TOAST, we provide a calculus featuring process timers which is capable of modelling timeouts using a receive-after pattern, much like Erlang, and capture the correspondence with TOAST specifications via a type system for which we prove subject reduction. |
| Author | Pears, Jonah Murgia, Maurizio Bocchi, Laura King, Andy |
| Author_xml | – sequence: 1 givenname: Jonah surname: Pears fullname: Pears, Jonah – sequence: 2 givenname: Laura surname: Bocchi fullname: Bocchi, Laura – sequence: 3 givenname: Maurizio surname: Murgia fullname: Murgia, Maurizio – sequence: 4 givenname: Andy surname: King fullname: King, Andy |
| BookMark | eNpVkE1PwkAQhjcGExH5Ad561EN1v7rdciNElATjgV48bYbdqZRAl-yWRP49BYzRucxkMu8zyXNLeo1vkJB7Rp-k4oV-3mxtTDl7ECP1yCnPrkifaUXTrMhl7898Q4YxrmlXQjDNVZ98lvUW_b5NxvHQ2FXwjd_HZIEx1r5JysMO4yhZQIX_D97rb3TpZOVri8nUh-SEccmsaTGAbbtsvCPXFWwiDn_6gJTTl3Lyls4_XmeT8Ty1guo21QXDTPBKAWjKnQWmlowXlIIGLjk4LZnMhYaMSmVz7SToDHPbZTAXQgzI7IJ1HtZmF-othIPxUJvzwocvA6Gt7QaNy7mtOHJAdDLL9JIqrgrmKtp9lQV0LHZh2eBjDFj98hg1Z9PmZNpwZoRR5mRaHAGPdnQb |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/lmcs-21(3:6)2025 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_d72cf2e2aeed4558b062691df0ca149a 10_46298_lmcs_21_3_6_2025 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c308t-891e532f6aa802dca16b12900a8a242ad8414738a5046c78d4a85e7c532e7333 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001536462100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:24:52 EDT 2025 Sat Nov 29 07:44:20 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c308t-891e532f6aa802dca16b12900a8a242ad8414738a5046c78d4a85e7c532e7333 |
| OpenAccessLink | https://doaj.org/article/d72cf2e2aeed4558b062691df0ca149a |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_d72cf2e2aeed4558b062691df0ca149a crossref_primary_10_46298_lmcs_21_3_6_2025 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-01-01 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – month: 01 year: 2025 text: 2025-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2025 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.3262749 |
| Snippet | Mixed-choice has long been barred from models of asynchronous communication since it compromises the decidability of key properties of communicating... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | logic in computer science |
| Title | Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions |
| URI | https://doaj.org/article/d72cf2e2aeed4558b062691df0ca149a |
| Volume | 21, Issue 3 |
| WOSCitedRecordID | wos001536462100002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yPHjxW5xf5OBBhbA2SZtktzk2PLghbMg8hTRJcaCbrJvoxb_dl3bKdvLipYeQPMLvte8rze8hdKniTHpmU5KLnBLuJCOGZo7AmAKX4FxU8hY83ot-X45G6mGl1Vf4J6yiB66AazhBbU49NWDMeZLILIIQXMUuj6yB6L4MjSKhVpKp0gYzFgLn6hiTp1TJxsurLQiNr1gzvYaMP1lzRCt8_aVj6e6i7WVEiFvVTvbQhp_so52fbgt4-fEdoKdwW2O6mONW8TmxgdMWknY8qHg1cMgniyYemNyvT-iNP7wj7ecpWATcnc5wEONwWQmsLjUUh2jY7Qzbd2TZGIFYFsk5kSr2CaN5aoyMqAMg0izUkyIjDbhc4ySPuWDSJJD9WiEdNzLxwsIaLxhjR6g2mU78McJO5aEHFU9ACuciyxRLfQaQswgWxWkd3fyApN8q-gsNaUOJqA6IahprplMdEK2j2wDj78TAXF0OgD71Up_6L32e_IeQU7QVNlSVSs5QbT5b-HO0ad_n42J2Ub4q8Ox9db4BhvPFnA |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Timeout+Asynchronous+Session+Types%3A+Safe+Asynchronous+Mixed-Choice+For+Timed+Interactions&rft.jtitle=Logical+methods+in+computer+science&rft.au=Jonah+Pears&rft.au=Laura+Bocchi&rft.au=Maurizio+Murgia&rft.au=Andy+King&rft.date=2025-01-01&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=21%2C+Issue+3&rft_id=info:doi/10.46298%2Flmcs-21%283%3A6%292025&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_d72cf2e2aeed4558b062691df0ca149a |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |