On the computational strength of pure ambient calculi

DOI10.1016/J.TCS.2004.10.007zbMath1078.68108OpenAlexW2009560105MaRDI QIDQ1763730

Iain Phillips, Sergio Maffeis

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.007

zbMATH Keywords

TerminationDecidabilityTuring completenessCounter machineAmbient calculus

Mathematics Subject Classification ID

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

Related Items (17)

Fair ambients ⋮ Theory of interaction ⋮ Reachability problems in BioAmbients ⋮ Distributability of mobile ambients ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Turing universality of the Biochemical Ground Form ⋮ Reachability analysis of fragments of mobile ambients in AC term rewriting ⋮ Symmetric electoral systems for ambient calculi ⋮ On the expressiveness of interaction ⋮ Decidable Fragments of a Higher Order Calculus with Locations ⋮ Deciding Reachability in Mobile Ambients with Name Restriction ⋮ Reachability Analysis in BioAmbients ⋮ Leader election in rings of ambient processes ⋮ On the Relative Expressive Power of Calculi for Mobility ⋮ Deciding reachability problems in Turing-complete fragments of Mobile Ambients ⋮ On the computational power of BlenX ⋮ FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mobile ambients
• On the expressive power of movement and restriction in pure mobile ambients
• Communication and mobility control in boxed ambients
• An overview of Boxed Ambients
• Separability in the Ambient Logic
• Process algebra for synchronous communication
• Proving termination with multiset orderings
• Extensionality and intensionality of the ambient logics
• Bisimulation congruences in safe ambients
• Foundations of Software Science and Computation Structures
• Programming Languages and Systems
• Automata, Languages and Programming
• Computability of Recursive Functions
• Well-structured transition systems everywhere!

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