Skip to main content
SpringerLink
Log in

Asynchronous mobile processes and graph rewriting

  • Conference paper
  • First Online:
Book cover PARLE '92 Parallel Architectures and Languages Europe (PARLE 1992)

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

Abstract

Honda and Tokoro provide a formal system for communicating systems developed from Milner's π-calculus. Unlike other formalisms, their work is based on asynchronous communication primitives.

This paper proposes some minor but practically significant extensions to a model based on asynchronous communication and shows how the resulting system may be mapped very directly onto a graph rewriting system.

While the model based on asynchronous communication permits the most direct translation, a related model using synchronous communication may be implemented in a similar manner.

Partially supported by ESPRIT BRA 3074: Semagraph

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. S. Abramsky: The Lazy Lambda Calculus. Chapter 4 in D. Turner (ed.), Research Topics in Functional Programming, pp. 65–116, Addison Wesley. (1988)

    Google Scholar 

  2. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, & M.R. Sleep: Term Graph Rewriting. Proc. PARLE 87, Springer LNCS 259, p141–158. (1987)

    Google Scholar 

  3. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, & M.R. Sleep: Lean: An Intermediate Language Based on Graph Rewriting. Parallel Computing, Vol 9, p163–177. (1989)

    Article  MathSciNet  Google Scholar 

  4. G. Berry & G. Boudol: The Chemical Abstract Machine. POPL 90, p 81–94. (1990)

    Google Scholar 

  5. D. Berry, R. Milner, & D.N. Turner: A semantics for ML concurrency primitives. Laboratory for Foundations of Computer Science, Edinburgh University. (1991)

    Google Scholar 

  6. F.W. Burton: Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs. TOPLAS, Vol 6, No 4, p159–174. (1984)

    Article  Google Scholar 

  7. U. Engberg & M. Nielsen: A Calculus of Communicating Systems with Label Passing. Report DAIMI PB-205, Computer Science Department, University of Aarhus. (1984)

    Google Scholar 

  8. A. Giacalone, P. Mishra, & S. Prasad: Facile: A Symmetric Integration of Concurrent and Functional Programming. IJPP, Vol 18, No 2, p121–160. (1989)

    Google Scholar 

  9. J.R.W. Glauert, J.R. Kennaway, & M.R. Sleep: Dactl: An Experimental Graph Rewriting Language Proc. 4th International Workshop on Graph Grammars, Bremen, 1990. Springer LNCS 532. (1991)

    Google Scholar 

  10. J.R.W. Glauert, K. Hammond, J.R. Kennaway & G.A. Papadopoulos: Using Dactl to Implement Declarative Languages. CONPAR88, Manchester, UK, Sept. 12–16, Vol. 1, pp. 89–94. (1988)

    Google Scholar 

  11. J.R.W. Glauert & G.A. Papadopoulos: A Parallel Implementation of GHC. Proceedings International Conference on Fifth Generation Computer Systems. ICOT, Tokyo, December 1988. (1988)

    Google Scholar 

  12. J.R.W. Glauert & G.A. Papadopoulos: Unifying Concurrent Logic and Functional Languages in a Graph Rewriting Framework. Proceedings, 3rd Panhellenic Computer Science Conference, Athens, May 1991. (1991)

    Google Scholar 

  13. J.R.W. Glauert, L. Leth & B. Thomsen: A New Translation of Functions as Processes. SemaGraph '91 Symposium, December 1991. (1991)

    Google Scholar 

  14. K. Honda & M. Tokoro: An object calculus for asynchronous communication. Proc. ECOOP'91, Geneva, July 1991. (1991)

    Google Scholar 

  15. J.R. Kennaway & M.R. Sleep: Expressions as Processes. Proc. Lisp and FP, August 1982, p.21–28. (1982)

    Google Scholar 

  16. J.R. Kennaway: Implementing Term Rewrite Languages in Dactl. Theor. Comp. Sci. 72, p.225–250. (1990)

    Article  Google Scholar 

  17. L. Leth: Functional Programs as Reconfigurable Networks of Communicating Processes. Ph.D Thesis, Imperial College, London University. (1991)

    Google Scholar 

  18. R. Milner: Calculus of Communicating Systems. Springer LNCS 92. (1980)

    Google Scholar 

  19. R. Milner: Functions as Processes. Automata, Languages, and Programming, Springer LNCS 443. (1990) Also as: Technical Report, INRIA Sophia Antipolis, June 1989.

    Google Scholar 

  20. R. Milner, J. Parrow, & D. Walker: A Calculus of Mobile Processes. Parts I and II. TR ECS-LFCS-89-85, Edinburgh University, June 1989. (1989)

    Google Scholar 

  21. B. Thomsen: A Calculus of Higher Order Communicating Systems. Proceedings of POPL 89, pp. 143–154, The Association for Computing Machinery. (1989)

    Google Scholar 

  22. B. Thomsen: Calculi for Higher Order Communicating Systems. Ph.D. Thesis, Imperial College, London University. (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of East Anglia, NR4 7TJ, Norwich, UK

    John Glauert

Authors
  1. John Glauert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel Etiemble Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glauert, J. (1992). Asynchronous mobile processes and graph rewriting. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-55599-4_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55599-5

  • Online ISBN: 978-3-540-47250-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation