When ambients cannot be opened

DOI10.1016/j.tcs.2004.10.020zbMath1070.68042OpenAlexW2121347054MaRDI QIDQ1770415

Jean-Marc Talbot, Iovka Boneva

Publication date: 6 April 2005

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

Full work available at URL: https://hal.inria.fr/inria-00536732/file/BonevaTalbot-WhenAmbientsCannotBeOpened.pdf

zbMATH Keywords

ExpressivenessAmbient calculusMobile computationReachability problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Reachability problems in BioAmbients, Reachability analysis of fragments of mobile ambients in AC term rewriting, Deciding Reachability in Mobile Ambients with Name Restriction, Reachability Analysis in BioAmbients, Leader election in rings of ambient processes, Multiset rewriting for the verification of depth-bounded processes with name binding, Deciding reachability problems in Turing-complete fragments of Mobile Ambients, On Reachability and Spatial Reachability in Fragments of BioAmbients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• A calculus of mobile processes. I
• Mobile ambients
• Separability in the Ambient Logic
• An Algorithm for the General Petri Net Reachability Problem
• On the decidability of fragments of the asynchronous π-calculus
• Controlling interference in ambients
• Anytime, anywhere