Deciding reachability problems in Turing-complete fragments of Mobile Ambients

Mathematical Structures in Computer Science

Volumn 19, Issue 6, 2009, Pages 1223-1263

  Zavattaro, Gianluigi ^a   Busi, Nadia ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

BOXED AMBIENTS; COMMUNICATION MECHANISMS; FOUNDATIONAL CALCULUS; GUARDED PROCESS; MOBILE AMBIENTS; PHILLIPS; REACHABILITY; REACHABILITY ANALYSIS; REACHABILITY PROBLEM; TARGET REACHABILITY;

CALCULATIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); MOBILE COMPUTING;

COMPUTABILITY AND DECIDABILITY;

EID: 74049111180     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129509990181     Document Type: Article

References (28)

1. Boneva, I. and Talbot, J.-M. (2003) When Ambients Cannot be Opened. Theoretical Computer Science 333 127-169.
2. Bugliesi, M., Castagna, G. and Crafa, S. (2004) Access Control for Mobile Agents: The Calculus of Boxed Ambients. ACM Transactions on Programming Languages and Systems 26 (1) 57-124.
3. Busi, N. (2000) Personal communication including the proof of Turing completeness of the open -free fragment of pure MA. The extended version of this proof appears in Busi and Zavattaro (2004).
4. Busi, N. and Zavattaro, G. (2004) On the Expressive Power of Movement and Restriction in Pure Mobile Ambients. Theoretical Computer Science 322 477-515.
5. Busi, N. and Zavattaro, G. (2005a) Deciding Reachability in Mobile Ambients. In: Proc. of ESOP. Springer-Verlag Lecture Notes in Computer Science 3444 248-262.
6. Busi, N. and Zavattaro, G. (2005b) Reachability Analysis in Boxed Ambients. In Proc. of ICTCS. Springer-Verlag Lecture Notes in Computer Science 3701 143-159.
7. Cardelli, L., Ghelli, G. and Gordon, A. D. (2002) Types for the ambient calculus. Information and Computation 177 (2) 160-194.
8. Cardelli, L. and Gordon, A. D. (2000a) Mobile Ambients. Theoretical Computer Science 240 (1) 177-213.
9. Cardelli, L. and Gordon, A. D. (2000b) Anytime, anywhere: Modal logics for mobile ambients. In: Proc. of POPL'00, ACM Press 365-377.
10. Cardelli, L. and Gordon, A. D. (2005) Ambient Logic. Accepted for publication in Mathematical Structures in Computer Science.
11. Delzanno, G. and Montagna, R. (2006) On Reachability and Spatial Reachability in Fragments of BioAmbients, In: Proc. MeCBIC'06. Electronic Notes in Theoretical Computer Science 171 (2) 69-79.
12. Delzanno, G., Giusto, C. D., Gabbrielli, M., Laneve, C. and Zavattaro, G. (2009) The Kappa-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages. In: Proc. of CMSB'09. Springer-Verlag Lecture Notes in Computer Science 5688 158-172.
13. Danos, V. and Laneve, C. (2004) Formal molecular biology. Theoretical Computer Science 325 (1) 69-110.
14. Gordon, A.D. and Cardelli, L. (2002) Equational Properties of Mobile Ambients. Mathematical Structures in Computer Science 12 1-38.
15. Karp, R.M. and Miller, R. E. (1969) Parallel Program Scemata. Journal of Computer and System Sciences 3 (2) 147-195.
16. Levi, F. and Sangiorgi, D. (2003) Mobile Safe Ambients. ACM Transactions on Programming Languages and Systems 25 (1) 1-69.
17. Maffeis, S. and Phillips, I. (2004) On the Computational Strength of Pure Mobile Ambients. Theoretical Computer Science 330 501-551.
18. Mayr, E.W. (1981) Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15 309-318.
19. Merro, M. and Hennessy, M. (2002) Bisimulation congruences in safe ambients. In: Proc. of POPL'02, ACM Press 71-80.
20. Milner, R., Parrow, J. and Walker, D. (1992) A calculus of mobile processes. Information and Computation 100 1-77.
21. Minsky, M.L. (1961) Recursive Unsolvability of Post's Problem of "Tag" and others Topics in the Theory of Turing Machines. Annals of Math. 74 :437-455.
22. Minsky, M.L. (1967) Computation: finite and infinite machines, Prentice-Hall.
23. Phillips, I. and Vigliotti, M. (2002) On reduction semantics for the push and pull ambient calculus. In: Proc. of IFIP International Conference on Theoretical Computer Science (TCS'02), Kluwer 550-562.
24. Regev, A., Panina, E. M., Silverman, W., Cardelli, L. and Shapiro, E.Y. (2004) BioAmbients: an abstraction for biological compartments. Theoretical Computer Science 325 (1) 141-167.
25. Reisig, W. (1985) Petri nets: An Introduction, EATCS Monographs in Computer Science, Springer- Verlag.
26. Reutenauer, C. (1988) The Mathematics of Petri Nets, Masson.
27. Shepherdson, J. C. and Sturgis, J.E. (1963) Computability of recursive functions. Journal of the ACM 10 217-255.
28. Zavattaro, G. (2008) Reachability Analysis in BioAmbients. In: Proc. MeCBIC'08. Electronic Notes in Theoretical Computer Science 227 179-193.