On the expressiveness of mixed choice sessions
From MaRDI portal
Publication:6190871
arXiv2209.06819MaRDI QIDQ6190871FDOQ6190871
Authors: Kirstin Peters, Nobuko Yoshida 
Publication date: 6 February 2024
Full work available at URL: https://arxiv.org/abs/2209.06819
Recommendations
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- A calculus of mobile processes. I
- Mobile ambients
- The origins of structural operational semantics
- Towards a unified approach to encodability and separation results for process calculi
- Expressiveness of process algebras
- On the expressiveness of interaction
- On distributability in process calculi
- What is a ``good encoding of guarded choice?
- Distributability of mobile ambients
- Theory of interaction
- Musings on encodings and expressiveness
- Synchrony versus causality in distributed systems
- Is it a ``good encoding of mixed choice?
- Breaking symmetries
- Analysing and comparing encodability criteria
- A theory of encodings and expressiveness (extended abstract)
- Coupled similarity: the first 32 years
- Title not available (Why is that?)
- Mixed sessions
- General conditions for full abstraction
- Exploring type-level bisimilarity towards more expressive multiparty session types
- Generalising Projection in Asynchronous Multiparty Session Types.
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
Cited In (2)
This page was built for publication: On the expressiveness of mixed choice sessions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190871)
