On the undecidability of asynchronous session subtyping

DOI10.1007/978-3-662-54458-7_26MaRDI QIDQ2988385zbMATH OpenOpenAlexFDO

Authors Julien Lange, Nobuko Yoshida

Publication date 19 May 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10044/1/44467

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Undecidability of asynchronous session subtyping
• On the boundary between decidability and undecidability of asynchronous session subtyping
• scientific article; zbMATH DE number 7327953
• On the preciseness of subtyping in session types
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus

Cites work

• Buffered Communication Analysis in Distributed Multiparty Sessions
• From communicating machines to graphical choreographies
• Full abstraction in a subtyped pi-calculus with linear types
• Global Principal Typing in Partially Commutative Asynchronous Sessions
• Honesty by typing
• Meeting deadlines together
• Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
• Multiparty session types meet communicating automata
• On Communicating Finite-State Machines
• On the expressiveness of multiparty sessions
• On the preciseness of subtyping in session types
• On the progress of communication between two finite state machines
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Session-Based Communication Optimisation for Higher-Order Mobile Processes
• Structured Communication-Centred Programming for Web Services
• Subtyping for session types in the pi calculus
• Subtyping Supports Safe Session Substitution
• Undecidability of asynchronous session subtyping
• Verification of programs with half-duplex communication
• Verifying identical communicating processes is undecidable

Cited in

(28)

• On the boundary between decidability and undecidability of asynchronous session subtyping
• Process calculi as a tool for studying coordination, contracts and session types
• Composition and decomposition of multiparty sessions
• Connecting open systems of communicating finite state machines
• Fair refinement for asynchronous session types
• Input urgent semantics for asynchronous timed session types
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Undecidability of asynchronous session subtyping
• Precise subtyping for synchronous multiparty sessions
• Exploring type-level bisimilarity towards more expressive multiparty session types
• Session Types with Arithmetic Refinements
• On the preciseness of subtyping in session types
• scientific article; zbMATH DE number 7327953 (Why is no real title available?)
• A Sound Algorithm for Asynchronous Session Subtyping
• Deconfined Global Types for Asynchronous Sessions
• Precise Subtyping for Asynchronous Multiparty Sessions
• A formal theory of choreographic programming
• Partially Typed Multiparty Sessions
• Relating Session Types and Behavioural Contracts: The Asynchronous Case
• Complete multiparty session type projection with automata
• Fair asynchronous session subtyping
• Partially typed multiparty sessions with internal delegation
• Completeness of asynchronous session tree subtyping in Coq
• A gentle overview of asynchronous session-based concurrency: deadlock freedom by typing
• Open compliance in multiparty sessions with partial typing
• Abstract subtyping for asynchronous multiparty sessions
• Formalising asynchronous session subtyping
• Asynchronous global protocols, precisely

This page was built for publication: On the undecidability of asynchronous session subtyping

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