Skip to main content

CCS — and its relationship to net theory

  • Section 8 Relationship To Other Models Of Concurrency
  • Conference paper
  • First Online:

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

Abstract

In this paper we give a short introduction to Milner's Calculus for Communicating Systems — a paradigm for concurrent computation. We put special emphasis on the basic concepts and tools from the underlying "algebraic approach", and their relationship to the approach to concurrency within net theory. Furthermore, we provide an operational version of the language CCS with "true concurrency" in the sense of net theory, and a discussion of the possible use of such a marriage of the two theories of concurrency.

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. S. Abramsky: Eliminating Local Non-Determinism, a New Semantics for CCS, Computer Systems Laboratory, Queen Mary College, Report No. 290, 1981.

    Google Scholar 

  2. P. Degano, R. De Nicola, U. Montanari: Observational Equivalences for Concurrency Models, 3rd Working Conference on the Formal Description of Programming Concepts, (to be published by North-Holland), 1986.

    Google Scholar 

  3. A. Mazurkiewics: Trace Theory, this volume.

    Google Scholar 

  4. R. Milner: A Calculus of Communicating Systems, Springer LNCS 92, 1980.

    Google Scholar 

  5. R. Milner: Lectures on a Calculus of Communicating Systems, in Seminar on Concurrency, Springer LNCS 197, 197–221, 1984.

    Google Scholar 

  6. R. De Nicola, M. Hennessy: Testing Equivalences for Processes, Theoretical Computer Science, 34, 83–134, 1984.

    Google Scholar 

  7. M. Nielsen, P.S. Thiagarajan: Degrees of Non-Determinism and Concurrency: A Petri Net View, Springer LNCS 181, 89–118, 1984.

    Google Scholar 

  8. E.R. Olderog: TCSP, Theory of Communicating Sequential Processes, in this volume.

    Google Scholar 

  9. G.D. Plotkin: Structural Approach to Operational Semantics, Computer Science Department, Aarhus University, Report No. FN-19, 1981.

    Google Scholar 

  10. G. Rozenberg: Behaviour of Elementary Net Systems, in this volume.

    Google Scholar 

  11. C. Stirling: Modal Logics for Communicating Systems, Dept. of Computer Science, University of Edinburgh, Report No. CSR-193-85, 1985.

    Google Scholar 

  12. P.S. Thiagarajan: Elementary Net Systems, in this volume.

    Google Scholar 

  13. G. Winskel: Event Structures, in this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W. Brauer W. Reisig G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, M. (1987). CCS — and its relationship to net theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Applications and Relationships to Other Models of Concurrency. ACPN 1986. Lecture Notes in Computer Science, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17906-2_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-17906-2_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17906-1

  • Online ISBN: 978-3-540-47926-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics