Fair ambients

Acta Informatica

Volumn 43, Issue 8, 2007, Pages 535-594

  Fu, Yuxi ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AMBIENTS; BISIMULATIONS; LABELED TRANSITIONS; MOBILE AMBIENTS; PI CALCULUS; STRUCTURAL INVESTIGATION;

SEMANTICS;

CALCULATIONS;

EID: 33947170090     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-007-0038-z     Document Type: Article

References (45)

1. Abramsky, S.: The lazy lambda calculus. In: Turner, D. (ed.) Declarative Programming, pp. 65-116. Addison-Wesley (1988)
2. Barendregt, H.: The lambda calculus: its syntax and semantics, Studies in Logic and Foundations of Mathematics, North-Holland (1984)
3. Boneva, I., Talbot, J.: When ambients cannot be opened. In: Gordon, A. (ed.) FoSSaCS 2003, pp. 169-184, Lecture Notes in Computer Science, vol. 2620 (2003)
4. Bugliesi, M., Castagna, G., Crafa, S.: Boxed ambients. In: Kobayashi, N., Pierce, B. (eds.) TACS 2001, pp. 38-63, Lecture Notes in Computer Science, vol. 2215 (2001)
5. Busi, N., Zavattaro, G.: On the expressive power of movement and restriction in pure mobile ambients. Theor. Coraput. Sci. 322, 477-515 (2004)
6. Cardelli, L.: Abstraction for mobile computation. In: Secure Internet Programming: Security Issues for Mobile and Distributed Object, pp. 51-94, Lecture Notes in Computer Science, vol. 1603 (1999)
7. Cardelli, L.: Brane calculi. In: Danos, V., Schächter, V. (eds.) International Conference on Computational Methods in System Biology, Paris, May 26-28, 2004, Lecture Notes in Computer Science, vol. 3082 (2005)
8. Cardelli, L., Gordon, A.: Mobile ambients. In: Nivat, M. (ed.) FoSSaCS 1998, pp. 140-155 Lecture Notes in Computer Science, vol. 1378, (1998)
9. Cardelli, L., Gordon, A.: Types for mobile ambients. In: POPL 1999, pp. 79-92. ACM (1999)
10. Cardelli, L., Gordon, A.: Anytime, anywhere: modal logics for mobile ambients. In: POPL 2000, pp. 365-377. ACM (2000)
11. Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comput. Sci. 240, 177-213 (2000)
12. Cardelli, L., Ghelli, G., Gordon, A.: Mobility types for mobile ambients. In: Wiedermann, J., Emde Boas, P., Nielsen, M. (eds.) ICALP 1999, pp. 230-239, Lecture Notes in Computer Science (1999)
13. Fu, Y.: Variations on mobile processes. Theor. Comput. Sci. 221, 327-368 (1999)
14. Fu, Y.: Bisimulation congruences of chi calculus. Inf. Comput. 184, 201-226 (2003)
15. Fu, Y.: On quasi open bisimulation. Theor. Comput. Sci. 338, 96-126 (2005)
16. Fu, Y.: Checking equivalences for higher order process, working paper (2006)
17. Fu, Y., Yang, Z.: Tau laws for pi calculus. Theor. Comput. Sci. 308, 55-130 (2003)
18. Guan, X., Yang, Y., You, J.: Typing evolving ambients. Inf. Process. Lett. 80, 265-270 (2001)
19. Gordon, A., Cardelli, L.: Equational properties of mobile ambients. Math. Struct. Comput. Sci. 13(3), 371-408 (2003)
20. Levi, F. Sangiorgi, D.: Controlling interference in ambients. In: POPL 2000, pp. 352-364. ACM (2000)
21. Maffeis, S., Phillips, I.: On the computational strength of pure ambient calculi. Theor. Comput. Sci. 330, 501-551 (2005)
22. Merro, M., Hennessy, M.: Bisimulation congruences in safe ambients. In: POPL 2002, pp. 71-80. ACM (2002)
23. Merro, M., Hennessy, M.: A bisimulation-based semantic theory of safe ambients. ACM Trans. Program. Languages Systems 28(2), 290-330 (2006)
24. Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for mobile ambients. In: Baeten, J., Lenstra, J., Parrow, J., Woeginger, G. (eds.) ICALP 2003, pp. 584-598, Lecture Notes in Computer Science, vol. 2719 (2003)
25. Merro, M., Zappa Nardelli, F.: Behavioural theory for mobile ambients. J. ACM 52(6), 961-1023 (2005)
26. Milner, R.: Communication and Concurrency. Prentice Hall, New Jersey (1989)
27. Milner, R.: Functions as processes. Math. Struct. Comput. Sci. 2, 119-146 (1992)
28. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. In: Information and Computation, vol. 100, pp. 1-40 (Part I), pp. 41-77 (Part II). Academic, New York (1992)
29. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Dershowitz, N., Lindenstrauss, N. (eds.) ICALP 1992, pp. 685-695, Lecture Notes in Computer Science, vol. 623 (1992)
30. Nestmann, U.: Welcome to the jungle: a subjective guide to mobile process calculi. In: Bauer, C., Hermanns. H. (eds.) CONCUR 2006, pp. 52-63, Lecture Notes in Computer Science, vol. 4137 (2006)
31. Phillips, I., Vigliotti, M.: On reduction semantics for the push and pull ambient calculus. In: TCS 2002, IFIP 17th World Computer Congress, Montreal. Kluwer (2002)
32. Phillips, I., Vigliotti, M.: Electoral systems in ambient calculi. In: Walukiewicz, I. (ed.) FoSSaCS 2004, pp. 408-422, Lecture Notes in Computer Science, vol. 2987 (2004)
33. Regev, A., Panina, E., Silverman, W., Cardelli, L., Shapiro, E.: Bioambients: an abstraction for biological compartments. Theor. Comput. Sci. 325(1), 141-167 (2004)
34. Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, PhD thesis, University of Edinburgh (1993)
35. Sangiorgi, D.: From π-calculus to higher order π-calculus-and back. In: Gaudel, M., Jouannaud, J. (eds.) TAPSOFP'93, pp. 151-166, Lecture Notes in Computer Science, vol. 668 (1993)
36. Sangiorgi, D.: The lazy lambda calculus in a concurrency scenario. Inf. Comput. 111, 120-153 (1994)
37. Sangiorgi, D.: A theory of bisimulation for π-calculus. Acta Inf. 3, 69-97 (1996)
38. Sangiorgi, D.: Bisimulation for higher order process calculi. Inf. Comput. 131(2), 141-178 (1996)
39. Sangiorgi, D., Milner, R.: Techniques of "Weak Bisimulation Up To". In: Cleaveland, W. (ed.) CONCUR 1992, pp. 32-46, Lecture Notes in Computer Science, vol. 630 (1992)
40. Sangiorgi, D., Walker, D.: On barbed equivalence in π-calculus. In: Larsen, K., Nielsen, M. (eds.) CONCUR 2001, pp. 292-304, Lecture Notes in Computer Science, vol. 2154 (2001)
41. Sangiorgi, D., Walker, D.: The Pi Calculus-A Theory of Mobile Processes. CUP (2001)
42. Teller, D., Zimmer, P., Hirschcoff, D.: Using ambients to control resources. In: Brim, L., Jancar, P., Kretinsky, M., Kucera, A. (eds.) CONCUR 2002, pp. 288-303, Lecture Notes in Computer Science, vol. 2421 (2002)
43. Vigliotti, M., Phillips, I.: Barbs and congruences for safe mobile ambients. Electr. Notes Theor. Comput. Sci. 66(3) (2002)
44. Zimmer, P.: On the expressiveness of pure mobile ambients. Electr. Notes Theor. Comput. Sci. 39(1) (2000)
45. Zimmer, P.: On the expressiveness of pure safe ambients. Math. Struct. Comput. Sci. 13(5), 721-770 (2003)