Minimality and separation results on asynchronous mobile processes: Representability theorems by concurrent combinators

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

Volumn 1466, Issue , 1998, Pages 131-146

  Yoshida, Nobuko ^a  

^a Univerity of Brighton   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; COMPUTATION THEORY;

EXPRESSIVE POWER; FINITE NUMBER; INTERACTION RULES; INTERACTION STRUCTURES; MOBILE PROCESS; PI CALCULUS; REPRESENTABILITY; WEAK BISIMILARITY;

CALCULATIONS;

EID: 18944387867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055620     Document Type: Conference Paper

References (41)

1. Abramsky, S., Interaction, Combinators, and Complexity, LFCS short course lecture, Edinburgh University, April, 1997.
2. Amadio, R., An asynchronous model of locality, failure, and process mobility. INRIA Research Report 3109, 1997.
3. Amadio, R., Casellani, I. and D., Sangiorgi, On Bisimulations for the Asynchronous π-calculus, Proc. CONCUR’96, LNCS 1119, pp. 147-162, Springer-Verlag, 1996.
4. Barendregt, H., The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984.
5. Berry, G. and Boudol, G., The Chemical Abstract Machine. TCS, vol 96, pp. 217-248, 1992.
6. Boreale, M., On the Expressiveness of Internal Mobility in Name-Passing Calculi, Proc. CONCUR’ 96, LNCS 1119, pp. 163-178, Springer-Verlag, 1996.
7. Boudol, G., Asynchrony and π-calcnlus. INRIA Report 1702, INRIA, Sophia Antipolis, 1992.
8. Boudol, G., Some chemical abstract machines, Proceedings of the REX School/Workshop "A Decade of Concurrency", LNCS 803, pp. 92-123, 1994.
9. Fournet, C. et al., A Cateutus for Mobile Agents, CONCUR’96, LNCS 1119, pp. 406-421, Springer-Verlag, 1996.
10. Danos, V., Herbelin, H. and Regnier, L., Games Semantics and Abstract Machines. LICS’96, 1996.
11. Honda, K., Two Bisimilarities in v-calculus, Keio Technical Report, 92-002, 1992.
12. Honda, K., Notes on P-Algebra (1): process Structure. Proc. TPPP’94, LNCS 907, pp. 25-44, Springer-Verlag, 1995.
13. Honda, K., Procesa Structure, 49 pp, a typescript. Submitted for publication, March, 1997. Available from http://wvw.dcs.ed.ac.uk/home/kohei.
14. Honda, K., Notes on Undirected Action Structure, a typescript, March, 1997. Available from http://www.dcs.ed.ac.uk/home/kohai.
15. Honda, K. and Tokoro, M., A Small Calculus for Concurrent Objects, in OOPS Messenger, 2(2):50-54, Association for Computing Machinery, 1991.
16. Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP’91, LNCS 512, pp. 133-147, Springer-Verlag 1991.
17. Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp. 437-486, № 151, North-Holland, 1995.
18. Honda, K. and Yoshida, N., Combinatory Representation of Mobile Processes. POPL '94, pp. 348-360, ACM Press, 1994.
19. Honda, K. and Yoshida, N., Replication in Concurrent Combinatoss, TACS’94, LNCS 789, pp. 786-805, Springer, 1994.
20. Full version of [18]. To appear as a technical report of Sussex University, 1998.
21. Merro, M. and Sanglorgi, D., On asynehrony in name-passlng calculi, ICALP’98, 1998.
22. Milner, R., Functions as Processes. MSCS, 2(2), pp. 119-146, 1992.
23. Milner, R., Polyadic π-Calculus, Logic and Algebra of Specification, Springer-Verlag, 1992.
24. Milner, R., Action structures and the π-calculus, Proc. of Advanced Study Institute on Proof and Computation, Marktoberdorf, 1993.
25. Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Information and Computation 100(1), pp. 1-77, 1992.
26. Nestmann, U. and Pierce, B., Decoding choice encodings, Proc. CONCUR’96, LNCS 1119, pp. 179-194, Springer-Verlag, 1996.
27. Odersky, M., Polarized Name Passing. FST/TCS’15, LNCS, Springer-Verlag, 1995.
28. Palamidessi, C., Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus, POPL’97, pp. 256-265, ACM press, 1997.
29. Parrow, J., The Expressive Power of Parallelism. Future Generation Computer Systems, 6:271-285, 1990.
30. Parrow, J., Trios in Concert. Festschrift in honour of Robin Milner, MIT Press, 1998.
31. Parrow, J. and Victor, B., The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. LICS’98, 1998.
32. Parrow, J. and Sangiorgi, D., Algebraic Theories for Name-Passing Calculi, Research Report ECSLFCS-93-262, Department of Computer Science, University of Edinburgh 1993.
33. Pierce, B. and Turner, D., Pict: A Programming Language Based on the Pi-calculus, Indiana University, CSCI Technical Report, 476, March, 1997.
34. Raja, N. and Shyamasundar, R.K., Combinatory Formulations of Concurrent Languages, TOPLAS, Vol. 19, № 6, pp. 899-915, ACM Press, 1997.
35. Riely, J. and Ilennessy, M., A Typed Language for Distibuted Mobile Processes. POPL’98, pp. 378-390, ACM Press, 1998.
36. Sangiorgi, D., Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.
37. Turner, D.A., A New Implementation Technique for Applicative Languages. Software-Practice and Experience 9, pp. 31-49, 1979.
38. Walker, D., Objects in the π-calculus. Information and Computation, Vol. 116, pp. 253-271, 1995.
39. Yoshida, N., Graph Notation for Concurrent Combinators, TPPP’94, LNCS 907, pp. 393-412, Springer-Verlag, 1995.
40. Yoshida, N., Graph Types for Monadic Mobile Processes, FST/TCS’16, LNCS 1180, pp. 371-386, Springer-Verlag, 1996. Full version as LFCS Technical Report, ECS-LFCS-96-350, 1996.
41. Yoshida, N., Full version of this paper. The first version in Oct, 1997. Revised in Feb, 1998. pp. 40. Available from http://www.cogs.susx.ac.uk/users/nobuko/index.html. To appear as a technical report of Sussex University, 1998.