On the expressiveness of movement in Pure Mobile Ambients

Electronic Notes in Theoretical Computer Science

Volumn 66, Issue 3, 2002, Pages 22-36

  Busi, Nadia ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; MATHEMATICAL OPERATORS; RANDOM ACCESS STORAGE; RECURSIVE FUNCTIONS; TURING MACHINES;

AMBIENT BOUNDARIES; MOBILE AMBIENTS (MA); MOBILE SYSTEMS; RESTRICTION OPERATORS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0142106773     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80414-6     Document Type: Conference Paper

References (15)

1. M. Bugliesi and G. Castagna. Secure safe ambients. In Proc. of POPL'01, pages 222-235. ACM Press, 2001.
2. M. Bugliesi, G. Castagna, and S. Crafa. Boxed ambients. In Proc. of TACS'01, volume 2215 of Lecture Notes in Theoretical Computer Science, pages 38-63. Springer-Verlag, Berlin, 2001.
3. Busi N., Gorrieri R., Zavattaro G. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science. 192:(2):1998;167-199
4. L. Cardelli and A.D. Gordon. Anytime, anywhere, modal logics for mobile ambients. In Proc. of POPL'00, pages 365-377. ACM Press, 2000.
5. Cardelli L., Gordon A.D. Mobile Ambients. Theoretical Computer Science. 240:(1):2000;177-213
6. W. Charatonik, A.D. Gordon, and J. Talbot. Finite-control mobile ambients. In Proc. of ESOP'02, volume to appear of Lecture Notes in Theoretical Computer Science. Springer-Verlag, Berlin, 2002.
7. Finkel A., Schnoebelen P.h. Well-Structured Transition Systems Everywhere ! Theoretical Computer Science. 256:2001;63-92
8. D. Hirschkoff, E. Lozes, and D. Sangiorgi. Separability, expressiveness, and decidability in the Ambient Logic. In Proc. of LICS'02, 2002.
9. Milner R. Communication and Concurrency. Prentice-Hall. 1989
10. Minsky M.L. Communication: finite and infinite machines. Prentice-Hall. 1967
11. Nestmann U., Pierce B.C. Decoding Choice Encodings. Information and Computation. 163:2000;1-59
12. M. Nielsen, C. Palamidessi, and F. D. Valencia. On the expressive power of temporal concurrent constraint programming languages. In Proc. of PPDP'02. ACM Press, 2002.
13. D. Sangiorgi. Extensionality and intensionality of the ambient logics. In Proc. of POPL'01, pages 4-17. ACM Press, 2001.
14. Shepherdson J.C., Sturgis J.E. Computability of recursive functions. Journal of the ACM. 10:1963;217-255
15. P. Zimmer. On the expressiveness of pure safe ambients. Technical Report RR-4350, INRIA Research, to appear in a special issue of Mathematical Structures of Computer Science, Cambridge University Press, 2002.