Deriving structural labelled transitions for mobile ambients

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

Volumn 5201 LNCS, Issue , 2008, Pages 462-476

  Rathke, Julian ^a   Sobociński, Paweł ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AMBIENT CALCULUSES; AMBIENTS; BISIMILARITY; CONTEXTUAL EQUIVALENCES; KEY FEATURES; LABELLED TRANSITION SYSTEMS; LABELLED TRANSITIONS; MOBILE AMBIENTS; REDUCTION SEMANTICS; STRUCTURAL STYLES; SYSTEMATIC PROCEDURES; TRANSITION SYSTEMS;

DIFFERENTIATION (CALCULUS); FRUIT JUICES; INFORMATION THEORY; MATHEMATICAL TECHNIQUES;

MODEL CHECKING;

EID: 54249132100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_36     Document Type: Conference Paper

References (26)

1. Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. Theor. Comput. Sci. 195(2), 291-324 (1998)
2. Bergstra, J., Klop, J.: Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37(1), 77-121 (1985)
3. Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication interference in mobile boxed ambients. Information and Computation 205, 1235-1273 (2007)
4. Cardelli, L., Ghelli, G., Gordon, A.: Mobility types for mobile ambients. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 230-239. Springer, Heidelberg (1999)
5. Cardelli, L., Gordon, A.: A commitment relation for the ambient calculus (unpublished notes, 1996)
6. Cardelli, L., Gordon, A.: Types for mobile ambients. In: Proc. POPL, pp. 79-92. ACM Press, New York (1999)
7. Cardelli, L., Gordon, A.: Mobile ambients. Theoretical Computer Science 240(1), 177-213 (2000)
8. Cardelli, L., Gordon, A.: Equational properties of mobile ambients. Math. Struct. Comput. Sci. 13(3), 371-408 (2003)
9. Engberg, U., Nielsen, M.: A calculus of communicating systems with label passing. Technical Report DAIMI PB-208, University of Aarhus (May 1986)
10. Fu, Y.: Fair ambients. Acta Inf. 43(8), 535-594 (2007)
11. Garralda, P., Bonelli, E., Compagnoni, A., Dezani-Ciancaglini, M.: Boxed Ambients with Communication Interfaces. MSCS 17, 1-59 (2007)
12. Hennessy, M., Merro, M.: Bisimulation congruences in safe ambients. ACM Transactions on Programming Languages and Systems 28(2), 290-330 (2006)
13. Hirschkoff, D., Pous, D., Sangiorgi, D.: An efficient abstract machine for safe ambients. J. Logic and Algebraic Programming 71, 114-149 (2007)
14. Hoare, C.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)
15. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133-147. Springer, Heidelberg (1991)
16. Jensen, O., Milner, R.: Bigraphs and mobile processes. Technical Report 570, Computer Laboratory. University of Cambridge (2003)
17. Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243-258. Springer, Heidelberg (2000)
18. Merro, M., Nardelli, F.Z.: Behavioural theory for mobile ambients. J. ACM 52(6), 961-1023 (2005)
19. Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In: Brim, L., Jančar, P., Křretínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 304-320. Springer, Heidelberg (2002)
20. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
21. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, II. Inf. Comput. 100(1), 41-77 (1992)
22. Phillips, A.: Specifying and Implementing Secure Mobile Applications in the Channel Ambient System. PhD thesis, Imperial College London (April 2006)
23. Plotkin, G.: A structural approach to operational semantics. Technical Report FN-19, DAIMI, Computer Science Department, Aarhus University (1981)
24. Rathke, J., Sobociński, P.: Deconstructing behavioural theories of mobility. In: Proc. IFIP TCS 5th International Conference on Theoretical Computer Science. Springer Science and Business Media (to appear, 2008)
25. Rathke, J., Sobociński, P.: Making the unobservable unobservable. In: Proc. ICE 2008. ENTCS. Elsevier, Amsterdam (to appear, 2008)
26. Sewell, P.: From rewrite rules to bisimulation congruences. Theor. Comput. Sci. 274(1-2), 183-230 (2002); Extended version of Concur 1998 conference paper