Skip to main content

Of wp and CSP

  • Chapter
Beauty Is Our Business

Part of the book series: Texts and Monographs in Computer Science ((MCS))

Abstract

A state-based and an event-based approach to concurrency are linked: the traces, failures and divergences of CSP are expressed as weakest precondition formulae over Action Systems. The result is simpler than is obtained using relations for the state-based view; in particular, divergence is handled easily. Essential use is made of miracles.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.-J. R. Back and R. Kurki-Suonio. Decentralization of process nets with centralized control. In Proc. Second Annual Symposium on Principles of Distributed Computing, Montreal, 1983.

    Google Scholar 

  2. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass., 1988.

    MATH  Google Scholar 

  3. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, 1976.

    MATH  Google Scholar 

  4. Jifeng He. Process simulation and refinement. 1989. To appear in Formal Aspects of Computing.

    Google Scholar 

  5. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985.

    MATH  Google Scholar 

  6. M. B. Josephs. A state-based approach to communicating processes. Distributed Computing, 3 (1): 9–18, December 1988.

    Article  MathSciNet  MATH  Google Scholar 

  7. C. C. Morgan. The specification statement. Trans. Prog. Lang. Sys., 10(3), July 1988. Reprinted in [8].

    Google Scholar 

  8. C. C. Morgan, K. A. Robinson, and P. H. B. Gardiner. On the Refinement Calculus. Technical Report PRG-70, Oxford University Computing Laboratory, 1988.

    Google Scholar 

  9. G. Nelson. A Generalization of Dijkstra’s Calculus. Technical Re-port 16, Digital Systems Research Center, April 1987.

    Google Scholar 

  10. E.-R. Olderog and C. A. R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Morgan, C. (1990). Of wp and CSP. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds) Beauty Is Our Business. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4476-9_37

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4476-9_37

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8792-6

  • Online ISBN: 978-1-4612-4476-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics