Abstract
A model for distributed computing systems called CCS, is explained. It is based on the primitive notion of communication and comprises of a simple language for defining communicating agents and a theory for analysing their behaviour. The language is defined using a small set of combinators for defining new agents from existing agents. The theory is based on a set of axioms which can be used to prove the behavioural equivalence of agents.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Milner, R., A Calculus of Communicating Systems, LNCS 92, 1980.
Milner, R., An Introduction to a Calculus of Communicating Systems, IUCC Conference, Exeter university, 1980.
Hennessy, M., Milner, R., On Observing Nondeterminism and Concurrency, LNCS 85, 1980.
Hennessy, M., Plotkin, G., A Term Model for CCS, LNCS 88, 1980.
Zhou Chao Chen, Hoare, C.A.R., Partial Correctness of Communication Protocols, Oxford University, 1981.
Hopcroft, J., Ullman, J., Formal Languages and their Relation to Automata, Addison Wesley, 1969.
Milne, G., A Mathematical Model for Concurrent Computation, Ph.D. thesis, Computer Science Dept., university of Edinburgh, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 D. Reidel Publishing Company
About this paper
Cite this paper
Hennessy, M.C.B. (1982). An Introduction to a Calculus of Communicating Systems. In: Beauchamp, K.G. (eds) New Advances in Distributed Computer Systems. Nato Advanced Study Institutes Series, vol 80. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7760-0_19
Download citation
DOI: https://doi.org/10.1007/978-94-009-7760-0_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7762-4
Online ISBN: 978-94-009-7760-0
eBook Packages: Springer Book Archive