Composition and decomposition of multiparty sessions
The authors look at multiparty sessions as open systems by allowing one to compose multiparty sessions by transforming two of their participants into a pair of coupled gateways, forwarding messages between the two sessions. It is shown that the session resulting from the composition can be typed, and its type can be computed from the global types of the starting sessions. As a consequence, lock-freedom is preserved by composition. Direct composition is also defined, which allows one to connect two global types without using gateways. Finally, a decomposition operator is proposed to split a global type into two, which is the left inverse of direct composition.
- A gentle introduction to multiparty asynchronous session types
- A type system for lock-free processes
- Connecting open systems of communicating finite state machines
- Coordination Via Types in an Event-Based Framework
- Deadlock and lock freedom in the linear -calculus
- Full abstraction in a subtyped pi-calculus with linear types
- Fundamental properties of infinite trees
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- Global progress for dynamically interleaved multiparty sessions
- scientific article; zbMATH DE number 6703933 (Why is no real title available?)
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- scientific article; zbMATH DE number 6851955 (Why is no real title available?)
- scientific article; zbMATH DE number 7454918 (Why is no real title available?)
- Models, Languages, and Tools for Concurrent and Distributed Programming
- Multiparty Asynchronous Session Types
- Multiparty asynchronous session types
- Multiparty Session Types Within a Canonical Binary Theory, and Beyond
- Observational equivalence for multiparty sessions
- On Communicating Finite-State Machines
- On resolving non-determinism in choreographies
- On the undecidability of asynchronous session subtyping
- Practical coinduction
- Precise subtyping for synchronous multiparty sessions
- Resolving non-determinism in choreographies
- Reversible client/server interactions
- Reversible sessions with flexible choices
- Subtyping for session types in the pi calculus
- Subtyping Supports Safe Session Substitution
- Synthesising Choreographies from Local Session Types
- Types and programing languages
- Undecidability of asynchronous session subtyping
- Global types with internal delegation
- Multiparty session types as coherence proofs
- Event structure semantics for multiparty sessions
- A type language for distributed reactive components governed by communication protocols
- Multiparty session nets
- Global escape in multiparty sessions
- Lightening global types
- Observational equivalence for multiparty sessions
- On the expressiveness of multiparty sessions
- Global progress for dynamically interleaved multiparty sessions
- Globally governed session semantics
- Composition of synchronous communicating systems
- On Composing Communicating Systems
- A Theory of Formal Choreographic Languages
- Partially Typed Multiparty Sessions
- Event structure semantics for multiparty sessions
- Global types and event structure semantics for asynchronous multiparty sessions
- Partially typed multiparty sessions with internal delegation
- Safe composition of systems of communicating finite state machines
- Open compliance in multiparty sessions with partial typing
- Safe orchestrated multicomposition of systems of communicating finite state machines
- Compositional active learning of synchronizing systems through automated alphabet refinement
- Partial and complete processes in multiparty sessions
This page was built for publication: Composition and decomposition of multiparty sessions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996856)
