Skip to main content
SpringerLink
Log in

Notes on P-algebra 1: Process structure

  • Invited Talk 1
  • 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 develop an elementary theory of process structure, a mathematical object which is intended to capture a basic aspect of concurrent processes in a simple way. It has two kinds of presentations, one underlying many extant process theories and another with a more geometric flavour, which are shown to be essentially equivalent. The theory forms a basis of P-algebra, a general semantic structure for concurrent processes.

Thanks to the participants of TPPP'94 for discussions, to the anonymous reviewer for useful suggestions, and to Nobuko Yoshida for her work on process graphs. The author is partially supported by JSPS Fellowships for Japanese Junior Scientists, for which he is grateful.

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. Cohn, P.M., Universal Algebra, D.Reidel, 1981.

    Google Scholar 

  3. Freyd, P.J. and Scedrov, A., Categories and Allegories, North-Holland, 1990.

    Google Scholar 

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

    Article  Google Scholar 

  5. Honda, K. Presenting Processes. Under preparation.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. Milner, R., Communication and Concurrency, Prentice Hall, 1989.

    Google Scholar 

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

    Google Scholar 

  13. 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 

  14. Yoshida, N., Graph Notation for Concurrent Combinators, in this volume.

    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

    Kohei Honda

Authors
  1. Kohei Honda
    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

Honda, K. (1995). Notes on P-algebra 1: Process structure. 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/BFb0026563

Download citation

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

  • 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