Nadia Busi, Gianluigi Zavattaro. Deciding reachability problems in Turing-complete fragments of Mobile Ambients. Mathematical Structures in Computer Science, 19(6):1223-1263, 2009. [doi]
@article{BusiZ09-0,
title = {Deciding reachability problems in Turing-complete fragments of Mobile Ambients},
author = {Nadia Busi and Gianluigi Zavattaro},
year = {2009},
doi = {10.1017/S0960129509990181},
url = {http://dx.doi.org/10.1017/S0960129509990181},
tags = {completeness, mobile},
researchr = {https://researchr.org/publication/BusiZ09-0},
cites = {0},
citedby = {0},
journal = {Mathematical Structures in Computer Science},
volume = {19},
number = {6},
pages = {1223-1263},
}