Bisimulation proof methods for mobile ambients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 584-598

  Merro, Massimo ^a   Zappa Nardelli, Francesco ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b LIENS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC LAWS; BISIMULATIONS; MOBILE AMBIENTS; OPERATIONAL SEMANTICS; PROOF METHODS;

SEMANTICS;

EID: 35248826856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_47     Document Type: Article

References (29)

1. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195:291-324, 1998.
2. M. Bugliesi, S. Crafa, M. Merro, and V. Sassone. Communication interference in mobile boxed ambients. Forthcoming Technical Report. An extended abstract appeared in Proc. FSTTCS'02, LNCS, Springer-Verlag.
3. L. Cardelli and A. Gordon. A commitment relation for the ambient calculus. Unpublished notes, 1996.
4. L. Cardelli and A. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177-213, 2000.
5. An extended abstract appeared in Proc. of FoSSaCS '98.
6. G. Castagna and F. Zappa Nardelli. The seal calculus revisited: Contextual equivalence and bisimilarity. In Proc. 22nd FSTTCS '02, volume 2556 of LNCS. Springer-Verlag, 2002.
7. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
8. G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchronization with mobility. In Proc. ICTCS, volume 2202 of LNCS, 2001.
9. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In Proc. 25th ICALP, pages 844-855, 1998.
10. J.C. Godskesen, T. Hildebrandt, and V. Sassone. A calculus of mobile resources. In Proc. 10th CONCUR '02, volume 2421 of LNCS, 2002.
11. A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. Journal of Mathematical Structures in Computer Science, 12:1-38, 2002.
12. M. Hennessy and J. Riely. A typed language for distributed mobile processes. In Proc. 25th POPL. ACM Press, 1998.
13. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437-486, 1995.
14. F. Levi and D. Sangiorgi. Controlling interference in ambients. In Proc. 27th POPL. ACM Press, 2000.
15. M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In Proc. 29th POPL '02. ACM Press, 2002.
16. M. Merro and F. Zappa Nardelli. Bisimulation proof methods for mobile ambients. Computer Science Report 2003:01, http://cogslib.cogs.susx.ac.uk/csr.abs.php?cs, University of Sussex, 2003.
17. M. Hennessy M. Merro and J. Rathke. Towards a behavioural theory of access and mobility control in distributed system. To appear in Proc. 5th FoSSaCS '03, LNCS, 2003, Springer-Verlag.
18. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1-77, 1992.
19. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proc. 19th ICALP, volume 623 of LNCS, pages 685-695. Springer Verlag, 1992.
20. D.M. Park. Concurrency on automata and infinite sequences. In P. Deussen, editor, Conf. on Theoretical Computer Science, volume 104 of LNCS. Springer Verlag, 1981.
21. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992.
22. D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141-178, 1996.
23. D. Sangiorgi. On the bisimulation proof method. Journal of Mathematical Structures in Computer Science, 8:447-479, 1998.
24. D. Sangiorgi. Extensionality and intensionality of the ambient logic. In Proc. 28th POPL. ACM Press, 2001.
25. D. Sangiorgi and R. Milner. The problem of "Weak Bisimulation up to". In Proc. CONCUR '92, volume 630 of LNCS, pages 32-46. Springer Verlag, 1992.
26. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
27. A. Unyapoth and P. Sewell. Nomadic Pict: Correct communication infrastructures for mobile computation. In Proc. 28th POPL. ACM, January 2001.
28. M. G. Vigliotti. Transition systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London), September 1999.
29. J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, 1999.