scientific article; zbMATH DE number 7327953
From MaRDI portal
Publication:5856424
Gianluigi Zavattaro, Marco Carbone, Julien Lange, Nobuko Yoshida, Mario Bravetti
Publication date: 26 March 2021
Full work available at URL: https://arxiv.org/abs/1907.00421
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Deconfined Global Types for Asynchronous Sessions ⋮ Communicating finite state machines and an extensible toolchain for multiparty session types ⋮ A formal theory of choreographic programming ⋮ Fair refinement for asynchronous session types
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of a class of communicating finite state machines
- Multiparty session types, beyond duality
- On the boundary between decidability and undecidability of asynchronous session subtyping
- Unreliable channels are easier to verify than perfect channels
- Verifying programs with unreliable channels
- Process calculi as a tool for studying coordination, contracts and session types
- Fair refinement for asynchronous session types
- Characteristic formulae for session types
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Undecidability of asynchronous session subtyping
- Subtyping for session types in the pi calculus
- From Communicating Machines to Graphical Choreographies
- Effects as sessions, sessions as effects
- Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time
- Multiparty Session Types Meet Communicating Automata
- Talking bananas: structural recursion for session types
- On the Undecidability of Asynchronous Session Subtyping
- Multiparty Asynchronous Session Types
- Multiparty asynchronous session types
- Decidable Topologies for Communicating Automata with FIFO and Bag Channels
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- On the expressive power of process interruption and compensation
- On Communicating Finite-State Machines
- On the progress of communication between two finite state machines
- A Petri Net Based Modeling of Active Objects and Futures
- Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
- A simple library implementation of binary sessions
- Context-Bounded Analysis of Concurrent Queue Systems
This page was built for publication:
