Skip to main content
SpringerLink
Log in

Minimality and separation results on asynchronous mobile processes

Representability theorems by concurrent combinators (extended abstract)

  • Conference paper
  • First Online:
CONCUR'98 Concurrency Theory (CONCUR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1466))

Included in the following conference series:

Abstract

In [18, 19], we presented a theory of concurrent combinators for the asynchronous monadic π-calculus without match or summation operator [7, 16]. The system of concurrent combinators is based on a finite number of atoms and fixed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing [23] and input guarded summations [26]. The present paper shows that each of the five basic combinators introduced in [18] is indispensable to represent the whole computation, i.e. if one of the combinators is missing, we can no longer express the original calculus up to weak bisimilarity. Expressive power of several interesting subsystems of the asynchronous π-calculus is also measured by using appropriate subsets of the combinators and their variants. Finally as an application of the main result, we show there is no semantically sound encoding of the calculus into its proper subsystem under a certain condition.

Partially supported by EPSRC GR/K60701.

Full version available at: http://www.cogs.susx.ac.uk/users/nobuka/index.html.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Interaction, Combinators, and Complexity, LFCS short course lecture, Edinburgh University, April, 1997.

    Google Scholar 

  2. Amadio, R., An asynchronous model of locality, failure, and process mobility. INRIA Research Report 3109, 1997.

    Google Scholar 

  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.

    Google Scholar 

  4. Barendregt, H., The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984.

    Google Scholar 

  5. Berry, G. and Boudol, G., The Chemical Abstract Machine. TCS, vol 96, pp. 217–248, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. Boreale, M., On the Expressiveness of Internal Mobility in Name-Passing Calculi, Proc. CONCUR'96, LNCS 1119, pp.163–178, Springer-Verlag, 1996.

    Google Scholar 

  7. Boudol, G., Asynchrony and π-calculus. INRIA Report 1702, INRIA, Sophia Antipolis, 1992.

    Google Scholar 

  8. Boudol, G., Some chemical abstract machines, Proceedings of the REX School/Workshop “A Decade of Concurrency”, LNCS 803, pp.92–123, 1994.

    MathSciNet  Google Scholar 

  9. Fournet, C. et al., A Calculus for Mobile Agents, CONCUR'96, LNCS 1119, pp.406–421, Springer-Verlag, 1996.

    MathSciNet  Google Scholar 

  10. Danos, V., Herbelin, H. and Regnier, L., Games Semantics and Abstract Machines. LICS'96, 1996.

    Google Scholar 

  11. Honda, K., Two Bisimilarities in Ν-calculus, Keio Technical Report, 92-002, 1992.

    Google Scholar 

  12. Honda, K., Notes on P-Algebra (1): Process Structure. Proc. TPPP'94, LNCS 907, pp.25–44, Springer-Verlag, 1995.

    Google Scholar 

  13. Honda, K., Process Structure, 49 pp, a typescript. Submitted for publication, March, 1997. Available from http://www.dcs.ed.ac.uk/home/kohei.

    Google Scholar 

  14. Honda, K., Notes on Undirected Action Structure, a typescript, March, 1997. Available from http://www.dcs.ed.ac.uk/home/kohei.

    Google Scholar 

  15. Honda, K. and Tokoro, M., A Small Calculus for Concurrent Objects, in OOPS Messenger, 2(2):50–54, Association for Computing Machinery, 1991.

    Google Scholar 

  16. Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, pp.133–147, Springer-Verlag 1991.

    Google Scholar 

  17. Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp.437–486, No.151, North-Holland, 1995.

    Google Scholar 

  18. Honda, K. and Yoshida, N., Combinatory Representation of Mobile Processes. POPL'94, pp.348–360, ACM Press, 1994.

    Google Scholar 

  19. Honda, K. and Yoshida, N., Replication in Concurrent Combinators, TACS'94, LNCS 789, pp.786–805, Springer, 1994.

    Google Scholar 

  20. Full version of [18]. To appear as a technical report of Sussex University, 1998.

    Google Scholar 

  21. Merro, M. and Sangiorgi, D., On asynchrony in name-passing calculi, ICALP'98, 1998.

    Google Scholar 

  22. Milner, R., Functions as Processes. MSCS, 2(2), pp.119–146, 1992.

    MATH  MathSciNet  Google Scholar 

  23. Milner, R., Polyadic π-Calculus, Logic and Algebra of Specification, Springer-Verlag, 1992.

    Google Scholar 

  24. Milner, R., Action structures and the π-calculus, Proc. of Advanced Study Institute on Proof and Computation, Marktoberdorf, 1993.

    Google Scholar 

  25. Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Information and Computation 100(1), pp.1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  26. Nestmann, U. and Pierce, B., Decoding choice encodings, Proc. CONCUR'96, LNCS 1119, pp.179–194, Springer-Verlag, 1996.

    Google Scholar 

  27. Odersky, M., Polarized Name Passing. FST/TCS'15, LNCS, Springer-Verlag, 1995.

    Google Scholar 

  28. Palamidessi, C., Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus, POPL'97, pp. 256–265, ACM press, 1997.

    Google Scholar 

  29. Parrow, J., The Expressive Power of Parallelism. Future Generation Computer Systems, 6:271–285, 1990.

    Article  Google Scholar 

  30. Parrow, J., Trios in Concert. Festschrift in honour of Robin Milner, MIT Press, 1998.

    Google Scholar 

  31. Parrow, J. and Victor, B., The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. LICS'98, 1998.

    Google Scholar 

  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.

    Google Scholar 

  33. Pierce, B. and Turner, D., Pict: A Programming Language Based on the Pi-calculus, Indiana University, CSCI Technical Report, 476, March, 1997.

    Google Scholar 

  34. Raja, N. and Shyamasundar, R.K., Combinatory Formulations of Concurrent Languages, TOPLAS, Vol. 19, No. 6, pp.899–915, ACM Press, 1997.

    Article  Google Scholar 

  35. Riely, J. and Hennessy, M., A Typed Language for Distibuted Mobile Processes. POPL'98, pp.378–390, ACM Press, 1998.

    Google Scholar 

  36. Sangiorgi, D., Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.

    Google Scholar 

  37. Turner, D.A., A New Implementation Technique for Applicative Languages., Software-Practice and Experience 9, pp.31–49, 1979.

    MATH  Google Scholar 

  38. Walker, D., Objects in the π-calculus. Information and Computation, Vol. 116, pp.253–271, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  39. Yoshida, N., Graph Notation for Concurrent Combinators, TPPP'94, LNCS 907, pp.393–412, Springer-Verlag, 1995.

    Google Scholar 

  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.

    Google Scholar 

  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/nobuka/index.html. To appear as a technical report of Sussex University, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, School of Cognitive and Computing Sciences, BN1 9QH, Brighton, UK

    Nobuko Yoshida

Authors
  1. Nobuko Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoshida, N. (1998). Minimality and separation results on asynchronous mobile processes. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055620

Download citation

  • DOI: https://doi.org/10.1007/BFb0055620

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation