On distributability in process calculi
From MaRDI portal
Publication:5326293
DOI10.1007/978-3-642-37036-6_18zbMATH Open1381.68215OpenAlexW2134322412MaRDI QIDQ5326293FDOQ5326293
Authors: Kirstin Peters, Uwe Nestmann, Ursula Goltz 
Publication date: 5 August 2013
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37036-6_18
Recommendations
Cited In (22)
- Full abstraction for expressiveness: history, myths and facts
- Title not available (Why is that?)
- The expressive power of monotonic parallel composition
- On distributability
- Encodability criteria for quantum based systems
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Title not available (Why is that?)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
- Title not available (Why is that?)
- Analysing and comparing encodability criteria
- Encoding CSP into CCS
- Psi-calculi revisited: connectivity and compositionality
- Coupled similarity: the first 32 years
- Replacement freeness: a criterion for separating process calculi
- Encodability criteria for quantum based systems
- On the relative expressiveness of higher-order session processes
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
- On the relative expressiveness of higher-order session processes
- On the distributability of mobile ambients
- Programming Languages and Systems
- Distributability of mobile ambients
- Mixed choice in session types
This page was built for publication: On distributability in process calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326293)
