{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:13:45Z","timestamp":1775873625494,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Multiparty session types are designed to abstractly capture the structure of\ncommunication protocols and verify behavioural properties. One important such\nproperty is progress, i.e., the absence of deadlock. Distributed algorithms\noften resemble multiparty communication protocols. But proving their\nproperties, in particular termination that is closely related to progress, can\nbe elaborate. Since distributed algorithms are often designed to cope with\nfaults, a first step towards using session types to verify distributed\nalgorithms is to integrate fault-tolerance. We extend multiparty session types\nto cope with system failures such as unreliable communication and process\ncrashes. Moreover, we augment the semantics of processes by failure patterns\nthat can be used to represent system requirements (as, e.g., failure\ndetectors). To illustrate our approach we analyse a variant of the well-known\nrotating coordinator algorithm by Chandra and Toueg.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:14)2023","type":"journal-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T09:45:19Z","timestamp":1701078319000},"source":"Crossref","is-referenced-by-count":3,"title":["FTMPST: Fault-Tolerant Multiparty Session Types"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Kirstin","family":"Peters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2023,11,27]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/lmcs.episciences.org\/12596\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/lmcs.episciences.org\/12596\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T09:45:20Z","timestamp":1701078320000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/10424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:14)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2204.07728v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2204.07728v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2204.07728","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2204.07728","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"article-number":"10424"}}