Composition and decomposition of multiparty sessions
From MaRDI portal
Publication:1996856
DOI10.1016/j.jlamp.2020.100620zbMath1462.68120OpenAlexW3094723157MaRDI QIDQ1996856
Ivan Lanese, Franco Barbanera, Emilio Tuosto, Mariangiola Dezani-Ciancaglini
Publication date: 26 February 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-03338671/file/OpenGTsynch-Main.pdf
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (6)
Composition of synchronous communicating systems ⋮ Event structure semantics for multiparty sessions ⋮ On Composing Communicating Systems ⋮ A Theory of Formal Choreographic Languages ⋮ Partially Typed Multiparty Sessions ⋮ A type language for distributed reactive components governed by communication protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible client/server interactions
- Fundamental properties of infinite trees
- Connecting open systems of communicating finite state machines
- Reversible sessions with flexible choices
- Undecidability of asynchronous session subtyping
- Precise subtyping for synchronous multiparty sessions
- A type system for lock-free processes
- Subtyping for session types in the pi calculus
- A Gentle Introduction to Multiparty Asynchronous Session Types
- Multiparty Session Types Within a Canonical Binary Theory, and Beyond
- Synthesising Choreographies from Local Session Types
- On the Undecidability of Asynchronous Session Subtyping
- Full Abstraction in a Subtyped pi-Calculus with Linear Types
- Multiparty Asynchronous Session Types
- Subtyping Supports Safe Session Substitution
- Multiparty asynchronous session types
- Coordination Via Types in an Event-Based Framework
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- On Communicating Finite-State Machines
- Deadlock and lock freedom in the linear π-calculus
- Observational Equivalence for Multiparty Sessions
- Models, Languages, and Tools for Concurrent and Distributed Programming
- Practical coinduction
- Resolving Non-determinism in Choreographies
- Global progress for dynamically interleaved multiparty sessions
This page was built for publication: Composition and decomposition of multiparty sessions