Deciding reachability in mobile ambients

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 248-262

  Busi, Nadia ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PROBLEM SOLVING;

FOUNDATIONAL CALCULUS; MOBILE AMBIENTS; REACHABILITY;

MOBILE COMPUTING;

EID: 24644462430     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_18     Document Type: Conference Paper

References (16)

1. I. Boneva and J.-M. Talbot. When Ambients Cannot be Opened. In Proc. FOSSACS'03, volume 2620 of Lecture Notes in Computer Science, pages 169-184.
2. Springer-Verlag, Berlin, 2003. Pull version to appear in Theoretical Computer Science, Elsevier.
3. N. Busi and G. Zavattaro. On the Expressive Power of Movement and Restriction in Pure Mobile Ambients. in Theoretical Computer Science, 322:477-515, Elsevier, 2004.
4. N. Busi and G. Zavattaro, Deciding Reachability in Mobile Ambients - Extended version. Available at http://www.cs.unibo.it/busi/papersaMA05.pdf /
5. L. Cardelli, G. Ghelli, and A.D. Gordon. Types for the ambient calculus Information and Computation, 177(2):160-194, 2002.
6. L. Cardelli and A.D. Gordon. Mobile Ambients. Theoretical Computer Science, 240(1):177-213, 2000.
7. L. Cardelli and A.D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proc. of POPL'00, pages 365-377. ACM Press, 2000.
8. L. Cardelli and A.D. Gordon. Ambient Logic. Mathematical Structures in Computer Science, to appear.
9. S. Maffeis and I. Phillips. On the Computational Strength of Pure Mobile Ambients. To appear in Theoretical Computer Science, Elsevier, 2004.
10. M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In Proc. of POPL'02, pages 71-80, ACM Press, 2002.
11. R. Milner, J. Parrow, D. Walker. A calculus of mobile processes. Journal of Information and Computation, 100:1-77. Academic Press, 1992.
12. M.L. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and others Topics in the Theory of Turing Machines. Annals of Math., 74:437-455, 1961.
13. M.L. Minsky. Computation: finite and infinite machines. Prentice-Hall, 1967.
14. C. Reutenauer. The Mathematics of Petri Nets. Masson, 1988.
15. W. Reisig. Petri nets: An Introduction. EATCS Monographs in Computer Science, Springer, 1985.
16. J.C. Shepherdson and J.E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217-255, 1963.