Asynchronous Sessions with  Input Races

Castellani, Ilaria; Dezani‐Ciancaglini, Mariangiola; Giannini, Paola

doi:10.4204/eptcs.356.2

Cited by 5 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

“…To the best of our knowledge global types with split outputs and inputs are considered only in [CDG21,DGD21,CDG22]. The above network can be typed in [DGD21] and in [CDG22], but not in [CDG21]. In [CDG21,DGD21] there is no choice of inputs and the running example of the current paper cannot be typed.…”

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

“…In [CDG21,DGD21] there is no choice of inputs and the running example of the current paper cannot be typed. Instead [CDG22] further extends the syntax of global types by allowing multiple senders in internal choices and multiple receivers in external choices. The obtained typing is undecidable and it does not ensure the absence of orphan messages.…”

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

“…• networks are typed by global types, while in all other papers, but [CDG22], either global types are projected onto local types and local types are assigned to processes or global types are projected onto processes; • the proof that the type system allows us to type an arbitrary network is new;…”

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

See 3 more Smart Citations

Deconfined Global Types for Asynchronous Sessions

Dagnino¹,

Giannini²,

Dezani‐Ciancaglini³

2023

Logical Methods in Computer Science

View full text Add to dashboard Cite

Multiparty sessions with asynchronous communications and global types play an important role for the modelling of interaction protocols in distributed systems. In designing such calculi the aim is to enforce, by typing, good properties for all participants, maximising, at the same time, the accepted behaviours. Our type system improves the state-of-the-art by typing all asynchronous sessions and preserving the key properties of Subject Reduction, Session Fidelity and Progress when some well-formedness conditions are satisfied. The type system comes together with a sound and complete type inference algorithm. The well-formedness conditions are undecidable, but an algorithm checking an expressive restriction of them recovers the effectiveness of typing.

show abstract

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

Section: The Undecidability Of (Weak) Balancingmentioning

confidence: 99%

See 2 more Smart Citations

Deconfined Global Types for Asynchronous Sessions

Dagnino¹,

Giannini²,

Dezani‐Ciancaglini³

2023

Logical Methods in Computer Science

View full text Add to dashboard Cite

show abstract

“…For a detailed overview of MST frameworks with generalised choice, we refer to their work [46]. The global types by Castellani et al [18] specify send and receive events independently and allow to receive from different senders. Dagnino et al [26] consider similar global types but each term requires to send to a single receiver and to receive from a single sender upon branching though.…”

Section: Implementability With Intra-role Reordering Is Undecidablementioning

confidence: 99%

Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

Stutz

Zufferey

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Communicating state machines provide a formal foundation for distributed computation. Unfortunately, they are Turing-complete and, thus, challenging to analyse. In this paper, we classify restrictions on channels which have been proposed to work around the undecidability of verification questions. We compare half-duplex communication, existential B-boundedness, and k-synchronisability. These restrictions do not prevent the communication channels from growing arbitrarily large but still restrict the power of the model. Each restriction gives rise to a set of languages so, for every pair of restrictions, we check whether one subsumes the other or if they are incomparable. We investigate their relationship in two different contexts: first, the one of communicating state machines, and, second, the one of communication protocol specifications using high-level message sequence charts. Surprisingly, these two contexts yield different conclusions. In addition, we integrate multiparty session types, another approach to specify communication protocols, into our classification. We show that multiparty session type languages are half-duplex, existentially 1-bounded, and 1-synchronisable. To show this result, we provide the first formal embedding of multiparty session types into high-level message sequence charts.

show abstract