Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions

2024-01-20

AI Summary

This work addresses the long-standing fundamental limitation of asynchronous session types: their inability to support mixed choice—essential for modeling timeouts. We present TOAST, the first asynchronous session type system with timeouts that guarantees both communication safety and strong progress. Our approach introduces a novel semantic framework for time-constrained mixed choice, enabling precise control over timeout behavior. We design a typed process calculus—inspired by Erlang—that natively supports process-local timers and the receive-after pattern. Through a rigorous subject reduction proof, we establish type safety and ensure behavioral consistency between typing derivations and actual timeout execution. TOAST thus provides a verifiable formal foundation for timed interaction protocols in web and cloud services, breaking the traditional prohibition on mixed choice in session type theory.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Multiagent Systems: Agent Communication
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterization
• Security and Privacy: Data transparency and provenance
• Responsible Web: Data and user privacy-enhancing technologies for the Web

Abstract

Mixed-choice has long been barred from models of asynchronous communication since it compromises the decidability of key properties of communicating finite-state machines. Session types inherit this restriction, which precludes them from fully modelling timeouts -- a core property of web and cloud services. To address this deficiency, we present (binary) Timeout Asynchronous Session Types (TOAST) as an extension to (binary) asynchronous timed session types, that permits mixed-choice. TOAST deploys timing constraints to regulate the use of mixed-choice so as to preserve communication safety. We provide a new behavioural semantics for TOAST which guarantees progress in the presence of mixed-choice. Building upon TOAST, we provide a calculus featuring process timers which is capable of modelling timeouts using a receive-after pattern, much like Erlang, and capture the correspondence with TOAST specifications via a type system for which we prove subject reduction.

Problem

• Enabling mixed-choice in asynchronous session types
• Modelling timeouts for web and cloud services
• Ensuring communication safety with timing constraints

Innovation

• Extends asynchronous session types with mixed-choice
• Uses timing constraints to ensure communication safety
• Introduces process timers for timeout modelling