Musings on encodings and expressiveness

MaRDI QIDQ4986261zbMATH OpenFDO

Authors Rob van Glabbeek

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2750, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS12.7

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A theory of encodings and expressiveness (extended abstract)
• scientific article; zbMATH DE number 177780
• Towards a unified approach to encodability and separation results for process calculi
• Analysing and comparing encodability criteria
• On the expressive power of programming languages

Cited in

(18)

• Comparing the expressiveness of the \(\pi \)-calculus and CCS
• Theory of interaction
• Translation of CCS into CSP, correct up to strong bisimulation
• From CCS to CSP: the \(m\)-among-\(n\) synchronisation approach
• 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
• Coupled similarity: the first 32 years
• On constructibility and unconstructibility of LTS operators from other LTS operators
• A theory of encodings and expressiveness (extended abstract)
• Ensuring liveness properties of distributed systems: open problems
• Expressiveness of concurrent intensionality
• scientific article; zbMATH DE number 7449992 (Why is no real title available?)
• Replacement freeness: a criterion for separating process calculi
• scientific article; zbMATH DE number 7440178 (Why is no real title available?)
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus

This page was built for publication: Musings on encodings and expressiveness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986261)