Skip to main content
SpringerLink
Log in

Lectures on a calculus for communicating systems

  • Conference paper
  • First Online:
Seminar on Concurrency (CONCURRENCY 1984)

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

Included in the following conference series:

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. Costa, G. and Stirling, C. (1983). A Fair Calculus of Communicating Systems. Vol. 154, Lecture Notes in Computer Science, Springer-Verlag, pp. 97–108.

    Google Scholar 

  2. Hennessy, M. and Milner R. (1983). Algebraice Laws for Nondeterminism and Concurrency. Technical Report CSR-133-83, Computer Science Dept, University of Edinburgh.

    Google Scholar 

  3. Hennessy, M. and Stirling, C. (1983). The Power of the Future Perfect in Program Logics. Technical Report CSR-156-83, Computer Science Dept, University of Edinburgh.

    Google Scholar 

  4. Hoare, C.A.R., Brookes, S.D. and Roscoe, A.D. (1981). A Theory of Communicating Sequential Processes, Technical Monograph PRG-16, Computing Laboratory, University of Oxford.

    Google Scholar 

  5. Milner, R. (1980). A Calculus of Communicating Systems. Vol. 92, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  6. Milner, R. (1982a). A Complete Inference System for a Class of Regular Behaviours. Technical Report CSR-111-82, Computer Science Dept, University of Edinburgh. (To appear in Journal of Computer and Systems Sciences.)

    Google Scholar 

  7. Milner, R. (1982b). A Finite Delay Operator in Synchronous CCS. Technical Report CSR-116-82, Computer Science Dept, University of Edinburgh.

    Google Scholar 

  8. Milner, R. (1983). Calculi for Synchrony and Asynchrony. J. Theoretical Computer Science, Vol. 25, pp. 267–310.

    Google Scholar 

  9. de Nicola, R. and Hennessy, M. (1982). Testing Equivalences for Processes. Technical Report CSR-123-82, Computer Science Dept, University of Edinburgh.

    Google Scholar 

  10. Park, D. (1981). Concurrency and Automata on Infinite Sequences. In Vol. 104, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Edinburgh University, King's Buildings Mayfield Road, Edinburgh, UK

    Robin Milner

Authors
  1. Robin Milner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen D. Brookes Andrew William Roscoe Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Milner, R. (1985). Lectures on a calculus for communicating systems. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds) Seminar on Concurrency. CONCURRENCY 1984. Lecture Notes in Computer Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15670-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-15670-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39593-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation