Generalising Projection in Asynchronous Multiparty Session Types

Majumdar, Rupak; Mukund, Madhavan; Stutz, Felix; Zufferey, Damien

doi:10.4230/lipics.concur.2021.35

Cited by 8 publications

(36 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the proposed syntax for global and local types is completely free, two well-formedness conditions are imposed on types, which are meant to prevent dangerous races. Sessions are synchronous in [10,14] and asynchronous in [17], which is the work that is closest to ours. In that paper, input races are allowed under sophisticated conditions on projections of global types.…”

Section: Introductionmentioning

confidence: 77%

“…The session of Example 1.2 cannot be typed in [14,10,17] because the syntax of global types does not allow two participants to exchange messages by first performing both outputs and then both inputs. If we omit the initial exchange of messages between Alice and Bob, the resulting session can be typed in [10,17] but not in [14].…”

Section: Example 12 (Fake Input Race In Asynchronous Sessionmentioning

confidence: 99%

“…Although these were useful simplifying assumptions in order to achieve multiparty session correctness, they limited the expressiveness of global types, ruling out relevant protocols. For this reason, more permissive choice constructors were investigated in subsequent work [1,2,9,16,13,3,5,14,10,17]. A widely adopted relaxation of the choice operator, originally proposed in [1], allows third participants to behave differently in different branches, provided they are notified of which branch has been chosen.…”

Section: Introductionmentioning

confidence: 99%

“…Recent proposals introduce more flexibility in input choices for processes [3,5,14,10,17]. The work [10] defines the property of race-freedom for sessions as the absence, at any stage of computation, of a branching between communications from different senders towards the same receiver leading to distinct target states.…”

Section: Introductionmentioning

confidence: 99%

“…This kind of input race will be called confluent. The above session is well typed in [14], but not in [10,17], where the syntax of global types forbids different senders in a choice. In [10], this session is also ruled out by the race-freedom condition.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Asynchronous Sessions with Input Races

Castellani

Dezani‐Ciancaglini

Giannini

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We propose a calculus for asynchronous multiparty sessions where input choices with different senders are allowed in processes. We present a type system that accepts such input races provided they do not hinder lock-freedom.* This research has been supported by the ANR17-CE25-0014-01 CISC project. † This original research has the financial support of the Università del Piemonte Orientale. 1 We call "third participant" any participant which is not involved in the first communication of a branch.

show abstract

Section: Introductionmentioning

confidence: 77%

Section: Example 12 (Fake Input Race In Asynchronous Sessionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Asynchronous Sessions with Input Races

Castellani

Dezani‐Ciancaglini

Giannini

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

MAG$$\pi $$: Types for Failure-Prone Communication

Brun

Dardha

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multiparty Session Types (MPST) are a typing discipline for communication-centric systems, guaranteeing communication safety, deadlock freedom and protocol compliance. Several works have emerged which model failures and introduce fault-tolerance techniques. However, such works often make assumptions on the underlying network, e.g., assuming TCP-based communication where messages are guaranteed to be delivered; or adopting centralised reliable nodes and ad-hoc notions of reliability; or only addressing a single kind of failure, such as node crashes. In this work, we develop MAG$$\pi $$ π —a Multiparty, Asynchronous and Generalised $$\pi $$ π -calculus, which is the first language and type system to accommodate in unison: (i) the widest range of non-Byzantine faults, including message loss, delays and reordering; crash and link failures; and network partitioning; (ii) a novel and most general notion of reliability, taking into account the viewpoint of each participant in the protocol; (iii) a spectrum of network assumptions from the lowest UDP-based network programming to the TCP-based application level. We prove subject reduction and session fidelity; process properties (deadlock freedom, termination, etc.); failure-handling safety and reliability adherence.

show abstract

Complete Multiparty Session Type Projection with Automata

Stutz

Wies

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multiparty session types (MSTs) are a type-based approach to verifying communication protocols. Central to MSTs is a projection operator: a partial function that maps protocols represented as global types to correct-by-construction implementations for each participant, represented as a communicating state machine. Existing projection operators are syntactic in nature, and trade efficiency for completeness. We present the first projection operator that is sound, complete, and efficient. Our projection separates synthesis from checking implementability. For synthesis, we use a simple automata-theoretic construction; for checking implementability, we present succinct conditions that summarize insights into the property of implementability. We use these conditions to show that MST implementability is PSPACE-complete. This improves upon a previous decision procedure that is in EXPSPACE and applies to a smaller class of MSTs. We demonstrate the effectiveness of our approach using a prototype implementation, which handles global types not supported by previous work without sacrificing performance.

show abstract

Generalising Projection in Asynchronous Multiparty Session Types

Cited by 8 publications

References 0 publications

Asynchronous Sessions with Input Races

Asynchronous Sessions with Input Races

MAG$$\pi $$: Types for Failure-Prone Communication

Complete Multiparty Session Type Projection with Automata

Contact Info

Product

Resources

About