Locality and polyadicity in asynchronous name-passing calculi

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

Volumn 1784 LNCS, Issue , 2000, Pages 238-251

  Merro, Massimo ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; ENCODING (SYMBOLS); PATHOLOGY; SIGNAL ENCODING;

DIVERGENCE FREE; EXPRESSIVE POWER; NAME PASSING CALCULI; PI CALCULUS;

COMPUTATION THEORY;

EID: 23044518432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_16     Document Type: Conference Paper

References (30)

1. R. Amadio. An asynchronous model of locality, failure, and process mobility. In Proc. Coordi nation'97, LNCS 1282, Springer Verlag, 1997.
2. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous φ-calculus. Theoretical Computer Science, 195: 291-324, 1998.
3. S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Informatica, 29: 737-760, 1992.
4. M. Boreale. On the expressiveness of internal mobility in name-passing calculi. Theoretical Computer Science, 195: 205-226, 1998. (Pubitemid 128453446)
5. G. Boudol. Asynchrony and the φ-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992.
6. G. Boudol. The pi-calculus in direct style. In Proc. 24th POPL. ACM Press, 1997.
7. R. De Nicola and R. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34: 83-133, 1984.
8. C. Fournet and G. Gonthier. The Reflexive Chemical Abstract Machine and the Join calculus. In Proc. 23th POPL. ACM Press, 1996.
9. Y. Fu. A proof theoretical approach to communication. In 24th ICALP, volume 1256 of Lecture Notes in Computer Science. Springer Verlag, 1997.
10. P. Gardner and L. Wischik. The φF-calculus: a φ-calculus with fusions. Personal Communication, 1999.
11. K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Proc. ECOOP'91, LNCS 512, Springer Verlag, 1991.
12. K. Honda and M. Tokoro. A Small Calculus for Concurrent Objects. In OOPS Messanger, Association for Computing Machinery. 2(2): 50-54, 1991.
13. M. Merro. Locality and polyadicity in asynchronous name-passing calculi. Available at http://www-sop.inria.fr/meije/personnel/Massimo.Merro.html., 1999.
14. M. Merro, H. Hüttel, J. Kleist, and U. Nestmann. Migrating Objects as Mobile Processes. To appear as a INRIA/BRICS Technical Report, 1999.
15. M. Merro and D. Sangiorgi. On asynchrony in name-passing calculi. In 25th ICALP, volume 1443 of Lecture Notes in Computer Science. Springer Verlag, 1998. The full-paper will appear as an INRIA Technical report.
16. R. Milner. The polyadic φ-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991.
17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100: 1-77, 1992.
18. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, 19th ICALP, LNCS 623, Springer Verlag, 1992.
19. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proc. LICS'98, IEEE Computer Society Press., 1998.
20. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press.
21. P. Quaglia and Walker D. On encoding pφ in mφ. In Proc. FST & TCS, volume 1530 of Lecture Notes in Computer Science, pages 42-53. Springer Verlag, 1998.
22. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and HigherOrder Paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992.
23. D. Sangiorgi. Lazy functions and mobile processes. Technical Report RR-2515, INRIA-Sophia Antipolis, 1995.
24. D. Sangiorgi. Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science, 155: 39-83, 1996. (Pubitemid 126411603)
25. D. Sangiorgi. φ-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2): 235-274, 1996. (Pubitemid 126412422)
26. D. Sangiorgi. The name discipline of receptiveness. In 24th ICALP, volume 1256 of Lecture Notes in Computer Science. Springer Verlag, 1997. To appear in TCS.
27. D. Sangiorgi and R. Milner. The problem of "Weak Bisimulation up to". In Proc. CONCUR '92, LNS 630, Springer Verlag, 1992.
28. D. Walker. Bisimulation and divergence. Information and Computation, 85(2): 202-241, 1990. (Pubitemid 20683819)
29. N. Yoshida. Graph types for monadic mobile processes. In Proc. FST & TCS, LCNS 1180, Springer Verlag, 1996.
30. N. Yoshida. Minimality and Separation Results on Asynchronous Mobile Processes: representability theorem by concurrent combinators. In 9th CONCUR, LNCS 1466, Springer Verlag, 1998.