Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1990: Automata, Languages and Programming pp 209–219Cite as

A theory of communicating processes with value-passing

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brinksma, E. “A Tutorial on LOTOS.” Proceedings of IFIP Workshop on Protocol Specification, Testing and Verification V, M. Diaz, ed., pp. 73–84. North-Holland, Amsterdam, 1986.

    Google Scholar 

  2. DeNicola, R. and M. Hennessy. “Testing Equivalences for Processes.” Theoretical Computer Science, 24, 1984, pp. 83–113.

    Google Scholar 

  3. Guessarian, I., “Algebraic Semantics”, Springer-Verlag Lecture Notes in Computer Science, vol.99, 1981.

    Google Scholar 

  4. Hennessy, M. and Plotkin, G., “A Term Model for CCS”, Springer-Verlag Lecture Notes in Computer Science, vol.88, 1980.

    Google Scholar 

  5. Hennessy, M. “Acceptance Trees.” Journal of the ACM, v. 32, n. 4, October 1985, pp. 896–928.

    Google Scholar 

  6. Hennessy, M. Algebraic Theory of Processes. MIT Press, Cambridge, 1988.

    Google Scholar 

  7. Hennessy, M., “A Proof System for Communicating Processes With Value — Passing”. Proceedings of Foundation of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, Springer-Verlag, Lecture Notes in Computer Science, vol 405, pp 325–339, 1989.

    Google Scholar 

  8. Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall International, London, 1985.

    Google Scholar 

  9. Hoare, C.A.R. and Roscoe, A.W., “The Laws of Occam” PRG Monograph, Oxford University, 1986.

    Google Scholar 

  10. Inmos Ltd., The Occam Programming Manual, Prentice-Hall, London, 1984.

    Google Scholar 

  11. Milne, R., “Concurrency Models and Axioms”, RAISE/STC/REM/6/V2, STC Technology Ltd., 1988.

    Google Scholar 

  12. Milner, R. A Calculus of Communicating Systems, Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980.

    Google Scholar 

  13. Milner, R., Calculus for Communication and Concurrency, Prentice-Hall, London 1989.

    Google Scholar 

  14. Plotkin, G., “Lecture Notes in Domain Theory”, University of Edinburgh, 1981.

    Google Scholar 

  15. Roscoe, A.W., “Denotational Semantics for Occam”, PRG Monograph, Oxford University, 1988.

    Google Scholar 

  16. Schmidt, D., Denotational Semantics, Allen and Bacon, 1986.

    Google Scholar 

  17. Smyth, M. and Plotkin, G., ”The Category-Theoretic Solution of Recursive Domain Equations”, SIAM Journal on Computing, vol.11, No.4, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Sussex, UK

    M. Hennessy & A. Ingólfsdóttir

Authors
  1. M. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ingólfsdóttir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hennessy, M., Ingólfsdóttir, A. (1990). A theory of communicating processes with value-passing. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032033

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation