Fair refinement for asynchronous session types
From MaRDI portal
Publication:2233400
Cites work
- A foundational theory of contracts for multi-party service composition
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A theory of contracts for strong service compliance
- Characteristic formulae for session types
- Fair refinement for asynchronous session types
- Fair subtyping for multi-party session types
- Fair subtyping for open session types
- Fair testing
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- scientific article; zbMATH DE number 5286864 (Why is no real title available?)
- scientific article; zbMATH DE number 7327953 (Why is no real title available?)
- Modelling session types using contracts
- Multiparty Asynchronous Session Types
- Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
- On Communicating Finite-State Machines
- On the boundary between decidability and undecidability of asynchronous session subtyping
- On the completeness of verifying message passing programs under bounded asynchrony
- On the preciseness of subtyping in session types
- On the undecidability of asynchronous session subtyping
- Subtyping for session types in the pi calculus
- Testing equivalences for processes
- Undecidability of asynchronous session subtyping
Cited in
(5)
This page was built for publication: Fair refinement for asynchronous session types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233400)