Undecidability of asynchronous session subtyping
From MaRDI portal
Publication:2407107
DOI10.1016/J.IC.2017.07.010zbMath1376.68098arXiv1611.05026OpenAlexW2553870630MaRDI QIDQ2407107
Mario Bravetti, Gianluigi Zavattaro, Marco Carbone
Publication date: 28 September 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05026
Related Items (15)
Deconfined Global Types for Asynchronous Sessions ⋮ Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types ⋮ Unnamed Item ⋮ Precise subtyping for synchronous multiparty sessions ⋮ A formal theory of choreographic programming ⋮ Partially Typed Multiparty Sessions ⋮ On the boundary between decidability and undecidability of asynchronous session subtyping ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Fair refinement for asynchronous session types ⋮ Progress-preserving Refinements of CTA ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ Composition and decomposition of multiparty sessions ⋮ Session Types with Arithmetic Refinements ⋮ Probabilistic software product lines
Cites Work
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Subtyping for session types in the pi calculus
- On the Undecidability of Asynchronous Session Subtyping
- Multiparty Asynchronous Session Types
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- On Communicating Finite-State Machines
- Unnamed Item
This page was built for publication: Undecidability of asynchronous session subtyping