FTMPST: fault-tolerant multiparty session types

DOI10.46298/LMCS-19(4:14)2023MaRDI QIDQ6828067zbMATH OpenFDO

Authors Kirstin Peters, Uwe Nestmann, Christoph Wagner

Publication date 16 January 2024

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-19(4:14)2023

zbMATH Keywords

fault tolerancelink and crash failuresmultiparty session types

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

The authors present a fault-tolerant variant of Multi-Party Session Types (MPST) for systems that may suffer from message loss or crash failures. Unreliable communication and weakly reliable branching are implemented. The failure patterns in the semantics allow them to verify algorithms modulo system requirements. Subject reduction and progress are proven and a small but relevant case study is presented.

Cited in

(1)

• Timeout asynchronous session types: safe asynchronous mixed-choice for timed interactions

This page was built for publication: FTMPST: fault-tolerant multiparty session types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828067)