On distributability in process calculi

DOI10.1007/978-3-642-37036-6_18MaRDI QIDQ5326293zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• A taxonomy of process calculi for distribution and mobility
• On the distributability of mobile ambients
• On distributability
• scientific article; zbMATH DE number 2059568
• On the expressive power of polyadic synchronisation in -calculus

Cited in

(24)

• On the validity of encodings of the synchronous in the asynchronous -calculus
• On distributability
• Encodability criteria for quantum based systems
• Coupled similarity: the first 32 years
• Replacement freeness: a criterion for separating process calculi
• Distributability of mobile ambients
• On the relative expressiveness of higher-order session processes
• On the relative expressiveness of higher-order session processes
• The expressive power of monotonic parallel composition
• On the distributability of mobile ambients
• Comparing process calculi using encodings
• Analysing and comparing encodability criteria
• Encoding CSP into CCS
• scientific article; zbMATH DE number 7288621 (Why is no real title available?)
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous
• Programming Languages and Systems
• Full abstraction for expressiveness: history, myths and facts
• Comparing the expressiveness of the \(\pi \)-calculus and CCS
• Psi-calculi revisited: connectivity and compositionality
• On the expressiveness of mixed choice sessions
• Mixed choice in session types
• Encodability criteria for quantum based systems
• CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce
• Separation and encodability in mixed choice multiparty sessions

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)