On modelling mobility

Theoretical Computer Science

Volumn 240, Issue 1, 2000, Pages 147-176

  Amadio, Roberto M ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Bisimulation; Localities; Mobility; calculus

Indexed keywords

EID: 0012627178     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00230-3     Document Type: Article

References (40)

1. G. Agha, Actors: a Model of Concurrent Computation in Distributed Systems, MIT Press, Cambridge, MA, 1986.
2. R. Allen, R. Douence, D. Garlan, Specifying and analyzing dynamic software architectures, in: Proc. FASE'98, Lecture Notes in Computer Science, Vol. 1328, Springer, Berlin, 1998.
3. R. Amadio, An asynchronous model of locality, failure, and process mobility, in: Proc. Coordination 97, Lecture Notes in Computer Science, Vol. 1282, Springer, Berlin, 1997. Extended version appeared as RR-INRIA 3109.
4. R. Amadio, I. Castellani, D. Sangiorgi, On bisimulations for the asynchronous π-calculus, J. Theoret. Comput. Sci. 195 (1998) 291-324.
5. R. Amadio, L. Leth, B. Thomsen, From a concurrent λ-calculus to the π-calculus, in: Proc. Foundations of Computation Theory 95, Lecture Notes in Computer Science, Vol. 965, Springer, Berlin, 1995, pp. 106-115.
6. R. Amadio, S. Prasad, Localities and failures (extended summary), in: Proc. FST-TCS94, Lecture Notes in Computer Science, Vol. 880, Springer, Berlin, 1994, pp. 205-216. Extended version available at http://protis.univ-mrs.fr/~amadio/.
7. R. Amadio, S. Prasad, Modelling IP mobility, in: Proc. CONCUR98, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 301-316. Expanded version available at http://protis.univ-mrs.fr/~amadio.
8. J. Armstrong, M. Williams, C. Wikstrom, R. Virding, Concurrent Programming in Erlang, Prentice-Hall, Englewood Cliffs, NJ, 1996.
9. K. Arnold, J. Gosling, The Java Programming Language, Addison-Wesley, Reading, MA, 1997.
10. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, R. Reischuk, Renaming in an asynchronous environment, J. ACM 37 (1990) 524-548.
11. M. Boreale, On the expressiveness of internal mobility in name passing calculi, in: CONCUR 96, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996.
12. G. Boudol, Asynchrony and the π-calculus, Tech. Report, RR 1702, INRIA, Sophia-Antipolis, 1992.
13. G. Boudol, Some chemical abstract machines, Proc. of REX School, Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1993.
14. L. Cardelli, Obliq: a language with distributed scope, Proc. ACM Principles of Prog. Lang., 1995.
15. L. Cardelli, A. Gordon, Mobile ambients, in: Proc. FOSSACS, ETAPS 98, Lecture Notes in Computer Science, Vol. 1378, Springer, Berlin, 1998.
16. T. Chandra, V. Hadzilacos, S. Toueg, The weakest failure detector for solving consensus, J. ACM 43(4) (1996) 685-722.
17. T. Chandra, S. Toueg, Unreliable failure detectors for reliable distributed systems, J. ACM 43(2) (1996) 225-267.
18. U. Engberg, M. Nielsen, A calculus of communicating systems with label passing, Tech. Report, PB-208, Aarhus Computer Science Department, 1986.
19. M. Fischer, N. Lynch, M. Paterson, Impossibility of distributed consenus with one faulty process, J. ACM 32 (1995) 374-382.
20. C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, Proc. ACM Principles of Prog. Lang., 1996.
21. C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy, A calculus of mobile agents, in: Proc. CONCUR 96, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996.
22. M. Hennessy, J. Riely, A typed language for distributed mobile processes, Proc. ACM Principles of Prog. Lang., ACM, New York, 1998.
23. K. Honda, M. Tokoro. An object calculus for asynchronous communication, Proc. ECOOP 91, Geneve, 1991.
24. T. Janowski, Bisimulation and fault-tolerance, Ph.D. Thesis, University of Warwick, 1995.
25. D. Johnson, C. Perkins, Mobility support in IPv6 (RFC). Version expiring May 97, 1996.
26. N. Kobayashi, B. Pierce, D. Turner, Linearity in the π-calculus, Proc. ACM Principles of Prog. Lang., 1996.
27. F. Le Fessant, L. Maranget, Compiling join patterns, Electronic Notes in TCS, (1998) 16-13.
28. D. Le Metayer, Software architectures styles as graph grammars, Proc. ACM Symp. on the Foundations of Software Engineering, 1996.
29. C. Lee, Representation of switching circuits by binary decision diagrams, Bell System Tech. J. 38 (1959) 985-999.
30. N. Lynch, Distributed Algorithms, Kaufmann, 1996.
31. J. Magee, J. Kramer. Dynamic structure in software architecture, Proc. ACM Symp. on the Foundations of Software Engineering, 1996.
32. General Magic, The telescript programming guide, http://www.genmagic.com, 1997.
33. M. Merro, D. Sangiorgi, On asynchrony in name passing calculi. Proc. ICALP98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.
34. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes. Inform. Comput. 100(1) (1992) 1-77.
35. B. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes, Proc. IEEE Logic in Comp. Sci., 1993.
36. D. Sangiorgi, The name discipline of uniform receptiveness, Proc. ICALP 97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997.
37. G. Smolka, The Oz programming model, in: Proc. Computer Science Today, Lecture Notes in Computer Science, Vol. 1000, Springer, Berlin, 1995.
38. G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, Cambridge, 1995.
39. B. Thomsen, Plain Chocs, Acta Inform. 30 (1993) 1-59.
40. B. Thomsen, L. Leth, S. Prasad, T.M. Kuo, A. Kramer, F. Knabe, A. Giacalone, Facile Antigua release programming guide, Techn. Report, TR 93-20, ECRC, Munich, 1993.