Mixed sessions

Casal, Filipe; Mordido, Andreia; Vasconcelos, Vasco T.

doi:10.1016/j.tcs.2021.08.005

Cited by 7 publications

(59 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mixed sessions are variant of binary session types introduced by Casal, Mordido, and Vasconcelos in [6] with a choice-construct that combines prefixes for sending and receiving. We denote this language as CMV + .…”

Section: Mixed Sessionsmentioning

confidence: 99%

“…To obtain from P ut CMV + the set P CMV + of well-typed processes of CMV + , a type system is introduced in [6]. The syntax of types is given as:…”

Section: (R-iftmentioning

confidence: 99%

“…Following [6], we assume that the index sets I in types are not empty, that the label-priority-pairs l * are pairwise distinct in the branches of a choice type, and recursive types are contractive, i.e., contain no subterm of the form µt 1 . .…”

Section: (R-iftmentioning

confidence: 99%

“…The language CMV + is composed of well-typed processes and the semantics in Figure 2, i.e., CMV + = P CMV + , −→ , where P CMV + is the well-typed fragment of P ut CMV + . The language CMV is the fragment of CMV + with a standard branching construct instead of mixed choice (compare to [6]). The set of untyped processes P ut CMV replaces the choice construct of P ut CMV + by the following four constructs y!v.P | q y?x.P | x ⊳ l.P | x ⊲ {l i : P i } i∈I and keeps the constructs for parallel composition, restriction, conditionals, and inaction.…”

Section: (R-iftmentioning

confidence: 99%

“…In § 4 we reprove this result using the synchronisation pattern ⋆ from [31] instead as distinguishing feature (the second × ). Then we prove soundness of the encoding presented in [6] closing their open problem in § 5 (…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On the Expressiveness of Mixed Choice Sessions (Technical Report)

Peters¹,

Yoshida²

2022

Preprint

View full text Add to dashboard Cite

Session types provide a flexible programming style for structuring interaction, and are used to guarantee a safe and consistent composition of distributed processes. Traditional session types include only one-directional input (external) and output (internal) guarded choices. This prevents the session-processes to explore the full expressive power of the π-calculus where the mixed choices are proved more expressive than the (non-mixed) guarded choices. To account this issue, recently Casal, Mordido, and Vasconcelos proposed the binary session types with mixed choices (CMV + ). This paper carries a surprising, unfortunate result on CMV + : in spite of an inclusion of unrestricted channels with mixed choice, CMV + 's mixed choice is rather separate and not mixed. We prove this negative result using two methodologies (using either the leader election problem or a synchronisation pattern as distinguishing feature), showing that there exists no good encoding from the π-calculus into CMV + , preserving distribution. We then close their open problem on the encoding from CMV + into CMV (without mixed choice), proving its soundness and thereby that the encoding is good up to coupled similarity. This technical report extends a paper presented at the workshop EXPRESS/SOS'22.

show abstract

Section: Mixed Sessionsmentioning

confidence: 99%

“…To obtain from P ut CMV + the set P CMV + of well-typed processes of CMV + , a type system is introduced in [6]. The syntax of types is given as:…”

Section: (R-iftmentioning

confidence: 99%

Section: (R-iftmentioning

confidence: 99%

Section: (R-iftmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the Expressiveness of Mixed Choice Sessions (Technical Report)

Peters¹,

Yoshida²

2022

Preprint

View full text Add to dashboard Cite

show abstract

Deciding Subtyping for Asynchronous Multiparty Sessions

Li,

Stutz,

Wies

2024

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, represented as global types in the framework. We present a precise subtyping relation for asynchronous MSTs with communicating state machines (CSMs) as implementation model. We address two problems: when can a local implementation safely substitute another, and when does an arbitrary CSM implement a global type? We define safety with respect to a given global type, in terms of subprotocol fidelity and deadlock freedom. Our implementation model subsumes existing work which considers local types with restricted choice. We exploit the connection between MST subtyping and refinement to formulate concise conditions that are directly checkable on the candidate implementations, and use them to show that both problems are decidable in polynomial time.

show abstract