When ambients cannot be opened

Theoretical Computer Science

Volumn 333, Issue 1-2, 2005, Pages 127-169

  Boneva, Iovka ^a   Talbot, Jean Marc ^a  

^a UNIV LILLE   (France)

Author keywords

Ambient calculus; Expressiveness; Mobile computation; Reachability problem

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; MODAL ANALYSIS; THEOREM PROVING;

AMBIENT CALCULUS; EXPRESSIVENESS; MOBILE COMPUTATION; REACHABILITY PROBLEM;

PROBLEM SOLVING;

EID: 13644267104     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.020     Document Type: Conference Paper

References (24)

1. R. Amadio, C. Meyssonier, On the Decidability of Fragments of the Asynchronous pi-Calculus, ENTCS 52(1), Elsevier, 2002.
2. T. Amtoft, A.J. Kfoury, S.M. Pericás-Geertsen, What are polymorphically-typed ambients?, in: 10th European Symposium on Programming (ESOP 2001), Lecture Notes in Computer Science 2028, Springer, Berlin, 2001, pp. 206-220.
3. I. Boneva, J.-M. Talbot, When ambients cannot be opened, in: Foundations of Software Science and Computation Structures (FoSSaCS'03), Vol. 2620, Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 169-184.
4. M. Bugliesi, G. Castagna, S. Crafa, Boxed ambients, in: Theoretical Aspects of Computer Software (TACS 2001), Lecture Notes in Computer Science 2215, Springer, Berlin, 2001.
5. N. Busi, G. Zavattaro, On the expressiveness of movement in pure mobile ambients, in: Foundations of Wide Area Network Computing, ENTCS 66(3), Elsevier, 2002.
6. L. Cardelli, and A. Gordon Mobile ambients Theoret. Comput. Sci. 240 2000 177 213
7. L. Cardelli, A. Gordon, Anytime, anywhere: Modal logics for mobile ambients, in: 27th Symp. on Principles of Programming Languages (POPL'00), 2000, pp. 365-377.
8. W. Charatonik, A.D. Gordon, J.-M. Talbot, Finite-control mobile ambients, in: European Symposium on Programming (ESOP'02), Lecture Notes in Computer Science 2305, Springer, Berlin, 2002, pp. 295-313.
9. W. Charatonik, J.-M. Talbot, The decidability of model checking mobile ambients, in: Computer Science Logic (CSL'01), Lecture Notes in Computer Science 2142, Springer, Berlin, 2001, pp. 339-354.
10. S. Dal Zilio, Spatial congruence for ambients is decidable, in: 6th Asian Computing Science Conference (ASIAN'00), Vol. 1961, Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 88-103.
11. J. Feret, Abstract interpretation-based static analysis of mobile ambients, in: Eighth International Static Analysis Symposium (SAS'01), Lecture Notes in Computer Science 2126, Springer, Berlin, 2001.
12. A.D. Gordon, and L. Cardelli Equational properties of mobile ambients Math. Struct. Comput. Sci. 12 2002 1 38
13. R. Hansen, J. Jensen, F. Nielson, H.R. Nielson, Abstract interpretation of mobile ambients, in: Static Analysis (SAS'99), Lecture Notes in Computer Science 1694, Springer, Berlin, 1999, pp. 134-148.
14. D. Hirschkoff, Mise en œuvre de preuves de bisimulation, Ph.D. Thesis, Ecole Nationale des Ponts et Chaussées, 1999.
15. D. Hirschkoff, E. Lozes, D. Sangiorgi, Separability, expressiveness, and decidability in the ambient logic, in: Logic in Computer Science (LICS'02), IEEE, 2002, pp. 423-432.
16. F. Levi, D. Sangiorgi, Controlling interference in ambients, in: 27th Symp. on Principles of Programming Languages (POPL'00), 2000, pp. 352-364.
17. S. Maffeis, I. Phillips, On the computational strength of pure ambient calculi, in: 10th International Workshop on Expressiveness of Concurrency (EXPRESS'03), 2003.
18. E. Mayr An algorithm for the general petri net reachability problem SIAM J. Comput. 13 3 1984 441 460
19. R. Milner, J. Parrow, J. Walker, A calculus of mobile processes, I and II, Inform. Comput. 100(1) (1992) 1-40, 41-77.
20. M. Minsky Recursive unsolvability of post's problem of "Tag" and others topics in the theory of Turing machines Annals of Math. 74 1961 437 455
21. F. Nielson, H.R. Nielson, R. Hansen, J. Jensen, Validating firewalls in mobile ambients, in: Concurrency Theory (Concur'99), Lecture Notes in Computer Science 1664, Springer, Berlin, 1999, pp. 463-477.
22. I. Phillips, M. Vigliotti, On reduction semantics for the push and pull ambient calculus, in: 2nd IFIP Internat. Conf. on Theoretical Computer Science (TCS 2002), no. 223 in IFIP Conference Proceedings, Kluwer, 2002, pp. 550-562.
23. D. Teller, P. Zimmer, D. Hirschkoff, Using ambients to control resources, in: CONCUR 2002 - Concurrency Theory, Lecture Notes in Computer Science 2421, Springer, Berlin, 2002, pp. 288-303.
24. P. Zimmer, On the expressiveness of pure safe ambients, mathematical structures of computer science, Mathematical Structures in Computer Science, Vol. 13(5), Cambridge University Press, Cambridge, 2003, pp. 721-770.