Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A term model for CCS

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

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

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. (Goguen, J.A., Thatcher, J.W., Wagner, E.G. and Wright, J.B.) (1977) Initial algebra semantics and continuous algebras. JACM, Vol. 24, No. 1, 68–95.

    Google Scholar 

  2. Apt, K.R. (1979) Ten years of Hoare's logic, a survey. To appear.

    Google Scholar 

  3. Barendregt, H. (1977) The type-free lambda calculus. Handbook of Mathematical Logic (ed. J. Barwise), pp. 1092–1131, Amsterdam: North Holland.

    Google Scholar 

  4. Berry, G. (1979) Modèles Complètement Adéquats et Stables des Lambda-Calculus Typeées. Thèse de doctorat d'état. Université Paris VII.

    Google Scholar 

  5. Curry, H.B., Feys, R. and Craig, W. (1968) Combinatory Logic, Volume 1. Amsterdam: North Holland.

    Google Scholar 

  6. Hennessy, M.C.B. and Plotkin, G.D. (1979) Full abstraction for a simple parallel programming language. MFCS '79, Olomouc. Springer-Verlag Lecture Notes in Computer Science, Vol. 74, pp. 108–120.

    Google Scholar 

  7. Hennessy, M.C.B. and Milner, R. (1980) On observing nondeterminism and concurrency. ICALP '80. Noordwijkerhout. Springer Verlag Lecture Notes in Computer Science. To appear.

    Google Scholar 

  8. Hindley, J.R., Lercher, B. and Seldin, J.P. (1972) Introduction to combinatory logic. Cambridge: Cambridge University Press.

    Google Scholar 

  9. Hindley, J.R. and Longo, B. (1978) Lambda calculus models and extensionality. Universita degli Studi di Pisa, Istituto di Scienze dell'Informazione. Note Scientifiche S-78-4.

    Google Scholar 

  10. Landin, P.J. (1966) A lambda-calculus approach. Chapter 5. Advances in Programming and Non-Numerical Computation. Pergamon Press.

    Google Scholar 

  11. Milne, G.J. and Milner, R. (1979) Concurrent processes and their syntax. JACM, Vol. 26, No. 2, 302–321.

    Google Scholar 

  12. Milner, R. (1976) Models of LCF. Mathematical Centre Tracts, 82, pp. 49–63. Amsterdam.

    Google Scholar 

  13. Milner, R. (1977) Fully abstract models of typed λ-calculi. Theoretical Computer Science, Vol. 4, 1–22.

    Google Scholar 

  14. Milner, R. (1978) Algebras for communicating systems. Proc. AFCET/SMF Joint Colloquium in Applied Mathematics (Palaiseau, France). Also available as CSR-25-78, Computer Science Department, University of Edinburgh, 1978.

    Google Scholar 

  15. Milner, R. (1978) Synthesis of communicating behaviour. Proc. 7th MFCS Conference, Zakopane, Poland. Springer Verlag Lecture Notes in Computer Science, Vol.64, pp. 71–83. Berlin: Springer Verlag.

    Google Scholar 

  16. Milner, R. (1979) An algebraic theory for synchronisation. Theoretical Computer Science 4th GI Conference, Aachen. Springer Verlag Lecture Notes Computer Science, Vol. 67, pp. 27–35. Berlin: Springer Verlag.

    Google Scholar 

  17. Milner, R. (1979) Flowgraphs and flow algebras. JACM, Vol. 26, No. 4, 794–818.

    Google Scholar 

  18. Obtulowicz, A. (1977) Functorial semantics of the type free calculus. Fundamentals of Computation Theory. Springer Verlag Lecture Notes in Computer Science, Vol. 56, pp. 302–207. Berlin: Springer Verlag.

    Google Scholar 

  19. Petri, C.A. (1976) Nichtsequentielle Prozesse. Arbeitsberichte des IMMD, Bd. 9, Heft. 8, p.57 ff. Universität Erlangen-Nurnberg. Also Non Sequential Processes, Translation by P. Krause and J. Low. Internal Report GMD-ISF-77-05, Bonn (1977).

    Google Scholar 

  20. Plotkin, G.D. (1976) A powerdomain construction. SIAM Journal on Computing, Vol. 5, No. 3, 452–487.

    Google Scholar 

  21. Smyth, M. (1978) Powerdomains. JCSS, Vol. 16, No. 1.

    Google Scholar 

  22. Wegner, P. (1972) The Vienna definition language. Computing Surveys, Vol. 4, No. 1.

    Google Scholar 

  23. Hoare, C.A.R. (1978) Communicating sequential processes. CACM, Vol. 21, No. 8, 666–677.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh, Scotland

    M. C. B. Hennessy & G. D. Plotkin

Authors
  1. M. C. B. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. D. Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hennessy, M.C.B., Plotkin, G.D. (1980). A term model for CCS. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022510

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation