Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Specification of a simplified Network Service in CSP (Problem 2)

  • 4. Solutions
  • Conference paper
  • First Online:
The Analysis of Concurrent Systems

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

Abstract

The specification of a simplified Network Service is given in CSP.

Because specifications of such services are notoriously difficult, it is especially pleasing that in this case the problem can be decomposed into several more easily achieved sub-specifications. This decomposition greatly improves the credibility of the overall specification.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. C.A.R. Hoare; Notes on Communicating Sequential Processes; Programming Research Group Technical Monograph PRG-33; Oxford, August 1983

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

B. T. Denvir W. T. Harwood M. I. Jackson M. J. Wray

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morgan, C., Hoare, C.A.R. (1985). Specification of a simplified Network Service in CSP (Problem 2) . In: Denvir, B.T., Harwood, W.T., Jackson, M.I., Wray, M.J. (eds) The Analysis of Concurrent Systems. Lecture Notes in Computer Science, vol 207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16047-7_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-16047-7_56

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16047-2

  • Online ISBN: 978-3-540-39731-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics