On distributability in process calculi
From MaRDI portal
Publication:5326293
Recommendations
Cited in
(22)- Full abstraction for expressiveness: history, myths and facts
- Programming Languages and Systems
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- On the distributability of mobile ambients
- On the expressiveness of mixed choice sessions
- On the relative expressiveness of higher-order session processes
- Analysing and comparing encodability criteria
- Encoding CSP into CCS
- Mixed choice in session types
- Distributability of mobile ambients
- scientific article; zbMATH DE number 7288621 (Why is no real title available?)
- Coupled similarity: the first 32 years
- scientific article; zbMATH DE number 7449992 (Why is no real title available?)
- Replacement freeness: a criterion for separating process calculi
- Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
- The expressive power of monotonic parallel composition
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
- On the relative expressiveness of higher-order session processes
- Encodability criteria for quantum based systems
- Psi-calculi revisited: connectivity and compositionality
- Encodability criteria for quantum based systems
- On distributability
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)