Fair refinement for asynchronous session types
From MaRDI portal
Publication:2233400
DOI10.1007/978-3-030-71995-1_8OpenAlexW3136104499MaRDI QIDQ2233400
Gianluigi Zavattaro, Mario Bravetti, Julien Lange
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.08181
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair testing
- Testing equivalences for processes
- On the boundary between decidability and undecidability of asynchronous session subtyping
- Fair refinement for asynchronous session types
- Characteristic formulae for session types
- Undecidability of asynchronous session subtyping
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Subtyping for session types in the pi calculus
- On the Undecidability of Asynchronous Session Subtyping
- Multiparty Asynchronous Session Types
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- A theory of contracts for strong service compliance
- On Communicating Finite-State Machines
- Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
- Fair Subtyping for Open Session Types
- Fair subtyping for multi-party session types
- Modelling session types using contracts
- On the completeness of verifying message passing programs under bounded asynchrony
This page was built for publication: Fair refinement for asynchronous session types