When ambients cannot be opened
type: Item
instance of: scholarly article
title: When ambients cannot be opened
zbMATH Open document ID: 1070.68042
author: Iovka Boneva
author: Jean-Marc Talbot
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
full work available at URL: BonevaTalbot-WhenAmbientsCannotBeOpened.pdf
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 2153208
zbMATH Keywords: Ambient calculus
zbMATH Keywords: Expressiveness
zbMATH Keywords: Reachability problem
zbMATH Keywords: Mobile computation
MaRDI profile type: Publication
OpenAlex ID: W2121347054
cites work: On the decidability of fragments of the asynchronous π-calculus
cites work: Q2763674
cites work: Q4417858
cites work: Q5714432
cites work: Mobile ambients
cites work: Anytime, anywhere
cites work: Q4738363
cites work: Q4783317
cites work: Q2766526
cites work: Q4778710
cites work: Q4494378
cites work: Separability in the Ambient Logic
cites work: Controlling interference in ambients
cites work: On the computational strength of pure ambient calculi
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: A calculus of mobile processes. I
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Q4484494
DOI: 10.1016/J.TCS.2004.10.020
description: scientific article; zbMATH DE number 2153208