On the boundary between decidability and undecidability of asynchronous session subtyping

DOI10.1016/J.TCS.2018.02.010zbMath1388.68024arXiv1703.00659OpenAlexW2786270130MaRDI QIDQ1704600

Gianluigi Zavattaro, Mario Bravetti, Marco Carbone

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.00659

zbMATH Keywords

undecidabilitysession typesasynchronous subtyping

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Deconfined Global Types for Asynchronous Sessions ⋮ Precise Subtyping for Asynchronous Multiparty Sessions ⋮ Unnamed Item ⋮ Precise subtyping for synchronous multiparty sessions ⋮ A formal theory of choreographic programming ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Fair refinement for asynchronous session types ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ Probabilistic software product lines

Cites Work

• Unnamed Item
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Undecidability of asynchronous session subtyping
• Verification of programs with half-duplex communication
• Subtyping for session types in the pi calculus
• On the Undecidability of Asynchronous Session Subtyping
• Multiparty Asynchronous Session Types
• Subtyping Supports Safe Session Substitution
• Multiparty asynchronous session types
• Global Principal Typing in Partially Commutative Asynchronous Sessions

This page was built for publication: On the boundary between decidability and undecidability of asynchronous session subtyping