A sound and complete characterization of fair asynchronous session subtyping

DOI10.4230/LIPICS.CONCUR.2025.11MaRDI QIDQ7310281zbMATH OpenFDO

Authors Mario Bravetti, Luca Padovani, Gianluigi Zavattaro

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.11

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A Sound Algorithm for Asynchronous Session Subtyping
• Derivatives of Regular Expressions
• Fair asynchronous session subtyping
• Fair subtyping for multi-party session types
• Fair termination of multiparty sessions
• Fundamental properties of infinite trees
• Generalizing inference systems by coaxioms
• Global Principal Typing in Partially Commutative Asynchronous Sessions
• scientific article; zbMATH DE number 7037626 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 7327953 (Why is no real title available?)
• Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
• Multiparty Asynchronous Session Types
• On Communicating Finite-State Machines
• On the preciseness of subtyping in session types
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Subtyping for session types in the pi calculus
• Subtyping Supports Safe Session Substitution

This page was built for publication: A sound and complete characterization of fair asynchronous session subtyping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310281)