Advertisement

Lectures on a calculus for communicating systems

  • Robin Milner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 197)

Keywords

Normal Form Free Variable Lambda Calculus Recursion Rule Agent Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 5.
    Milner, R. (1980). A Calculus of Communicating Systems. Vol. 92, Lecture Notes in Computer Science, Springer-Verlag.Google Scholar
  6. 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. 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. 8.
    Milner, R. (1983). Calculi for Synchrony and Asynchrony. J. Theoretical Computer Science, Vol. 25, pp. 267–310.Google Scholar
  9. 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. 10.
    Park, D. (1981). Concurrency and Automata on Infinite Sequences. In Vol. 104, Lecture Notes in Computer Science, Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Robin Milner
    • 1
  1. 1.Department of Computer ScienceEdinburgh UniversityEdinburghUK

Personalised recommendations