On the computational strength of pure ambient calculi

zbMATH Open1271.68190MaRDI QIDQ2847404FDOQ2847404

Authors: Sergio Maffeis, Iain Phillips 

Publication date: 9 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104050303

Recommendations

• On the computational strength of pure ambient calculi
• On the expressive power of movement and restriction in pure mobile ambients
• On the expressiveness of pure mobile ambients
• Programming Languages and Systems
• Deciding reachability problems in Turing-complete fragments of Mobile Ambients

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (6)

• Linearity, persistence and testing semantics in the asynchronous pi-calculus
• On the computational strength of pure ambient calculi
• When ambients cannot be opened
• Name-passing in an ambient-like calculus and its proof using spatial logic
• On Recursion, Replication and Scope Mechanisms in Process Calculi
• On the expressive power of movement and restriction in pure mobile ambients

This page was built for publication: On the computational strength of pure ambient calculi

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