Skip to main content
SpringerLink
Log in

Graph notation for concurrent combinators

  • Invited Talk 8
  • Conference paper
  • First Online:
Theory and Practice of Parallel Programming (TPPP 1994)

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

Included in the following conference series:

Abstract

We introduce graph notation for concurrent processes which does not use the notion of port names for its formulation. The operators in the algebra of graphs proposed in this paper are quite different from those in the original term representation, making such notions as connection and correspondence of communication ports explicit. We show how basic elements of process calculi such as agents, reduction, and behavioural equivalences are soundly formulated in the new setting. The work is based on the authors' study on concurrent combinators [9, 10], and can be considered as offering another mathematical representation of the formal notion studied therein.

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. Berry, G. and Boudol, G., The Chemical Abstract Machine. Theoretical Computer Science, vol 96, pp. 217–248, 1992.

    Article  Google Scholar 

  2. Gay, S., Interaction Nets, Diploma in Computer Science in Queens', 1991.

    Google Scholar 

  3. Gay, S., Combinators for Interaction Nets, draft, July 29, 1994.

    Google Scholar 

  4. Girard, J.-Y., Linear Logic, Theoretical Computer Science, Vol. 50, pp.1–102, 1987.

    Article  Google Scholar 

  5. Gonthier, G., Abadi, M. and Levy, J.-J., The Geometry of Optimal Lambda Réduction, POPL'92, pp. 15–26, ACM press, 1992.

    Google Scholar 

  6. Honda, K., A Study of ν-calculus and its Combinatory Representation, Phd Thesis in the Department of Computer Science, October, 1994.

    Google Scholar 

  7. Honda, K., Notes on P-Algebra 1: Process Structure, in this volume.

    Google Scholar 

  8. Honda, K. and Yoshida, N., On Reduction-Based Process Semantics, 13th. FST/TCS, LNCS 761, pp.371–387, Springer-Verlag, 1993.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Honda, K. and Yoshida, N., Graphs for Connection and Interaction, the early version of this paper, May 1994.

    Google Scholar 

  12. Honda, K. and Yoshida, N., Nameless Concurrent Combinators, under preparation, December 1994, to appear as a Keio-CS-report.

    Google Scholar 

  13. Jones, C.B., Process-Algebraic Foundations for an Object-Based Design Notation, Technical Report UMCS-93-10-1, Manchester University, 1993.

    Google Scholar 

  14. Lafont, Y., Interaction Nets, POPL'90, pp. 95–108, ACM press, 1990.

    Google Scholar 

  15. Milner, R., Flowgraphs and Flow Algebras, Journal of ACM, 26(4), pp.794–818, 1979.

    Article  Google Scholar 

  16. Milner, R., A Calculus of Communicating Systems, LNCS 76, Springer-Verlag, 1980.

    Google Scholar 

  17. Milner, R., Functions as Processes. Mathematical Structure in Computer Science, 2(2), pp.119–146, 1992.

    Google Scholar 

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

    Google Scholar 

  19. Milner, R. and Sangiorgi, D., Barbed Bisimulation. ICALP'92, LNCS 623, pp.685–695, Springer-Verlag, 1992.

    Google Scholar 

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

    Article  Google Scholar 

  21. Milner, R., Action structure for the π-calculus. Research Report ECS-LFCS-93-264, Department of Computer Science, University of Edinburgh 1993.

    Google Scholar 

  22. Milner, R., Notes on actions I: π-nets with boxes and replication. Edinburgh, June 1993.

    Google Scholar 

  23. Parrow, J.G., Interaction Diagrams, REX'93., LNCS, Springer-Verlag, 1993.

    Google Scholar 

  24. Raja, N. and Shymasundar, R.K., The Next 700 Combinatory Representations of Mobile Processes, a manuscript, 1994.

    Google Scholar 

  25. Sangiorgi, D., A Theory of Bisimulation for the π-calculus, CONCUR'93, LNCS 715, pp.127–142, Springer-Verlag, 1992.

    Google Scholar 

  26. Thomsen, B., A calculus of higher order communicating systems. POPL'89, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223, Yokohama, Japan

    Nobuko Yoshida

Authors
  1. Nobuko Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takayasu Ito Akinori Yonezawa

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoshida, N. (1995). Graph notation for concurrent combinators. In: Ito, T., Yonezawa, A. (eds) Theory and Practice of Parallel Programming. TPPP 1994. Lecture Notes in Computer Science, vol 907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026581

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59172-6

  • Online ISBN: 978-3-540-49218-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation