Skip to main content
SpringerLink
Log in

A hierarchy of domains for real-time distributed computing

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1989)

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

Abstract

Together with A.W. Roscoe, the author has earlier presented two models (the Timed Stability Model and the Timed Failures-Stability Model) offering timed versions of Hoare's CSP. In this paper, the author outlines a hierarchy of untimed and timed models for CSP which includes the two above, and which allows one to reason about concurrent processes in a uniform fashion with the minimum of complexity. This hierarchy supports timewise refinement of specifications and the development of powerful proof rules for verification.

The work reported in this paper was supported by the U.S. Office of Naval Research.

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.

8 References

  1. A. Boucher, A time-based model for occam, Oxford University D.Phil. thesis 1986.

    Google Scholar 

  2. A. Boucher and R. Gerth, A timed failures model for extended communicating sequential processes, ICALP'87,Springer LNCS.

    Google Scholar 

  3. S.D. Brookes, A model for communicating sequential processes, Oxford University D.Phil. thesis 1983.

    Google Scholar 

  4. M. Broy, Fixed point theory for communication and concurrency, TC2 Working Conference on Formal Description of Programming Concepts II, Garmisch, 1982.

    Google Scholar 

  5. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe, A theory of communicating sequential processes, JACM 31 (1984), 560–599.

    Article  MATH  MathSciNet  Google Scholar 

  6. S.D. Brookes and A.W. Roscoe, An improved failures model for communicating processes, Proceedings of the Pittsburgh Seminar on Concurrency, Springer LNCS 197 (1985).

    Google Scholar 

  7. J.W. de Bakker and J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982), 70–120.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Engelking, General Topology, Polish Scientific Publishers (1977).

    Google Scholar 

  9. W.G. Golson and W.C. Rounds, Connections between two theories of concurrency: metric spaces and synchronisation trees, Information and Control 57 (1983), 102–124.

    Article  MATH  MathSciNet  Google Scholar 

  10. C.A.R. Hoare, Communicating sequential processes, CACM 21 (1978), 666–677.

    MATH  Google Scholar 

  11. C.A.R. Hoare, A model for communicating sequential processes, On the construction of programs CUP (1980), 229–248.

    Google Scholar 

  12. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985.

    Google Scholar 

  13. C.A.R. Hoare, S.D. Brookes and A.W. Roscoe, A theory of communicating sequential processes, Oxford University Computing Laboratory technical monograph PRG-16 (1981).

    Google Scholar 

  14. G. Jones, A timed model for communicating processes, Oxford University D.Phil thesis, 1982.

    Google Scholar 

  15. R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth and S. Arun-Kumar, Compositional semantics for real-time distributed computing, Faculteit der Wiskunde en Natuurwetenschappen, Katholieke Universiteit, Nijmegen, technical report 68, 1985.

    Google Scholar 

  16. R. Milner, A calculus of communicating systems, Springer LNCS 92 (1980).

    Google Scholar 

  17. R. Milner, Calculi for synchrong and asynchrony, Theoretical Computer Science 25 (1983), 267–310.

    Article  MATH  MathSciNet  Google Scholar 

  18. M. Nivat, Infinite words, infinite trees, infinite computations, Foundations of Computer Science III (Math. Centre Tracts 109, 1979), 3–52.

    Google Scholar 

  19. The occam programming manual, (Inmos Ltd.) Prentice-Hall (1984).

    Google Scholar 

  20. E.R. Olderog and C.A.R. Hoare, Specification-oriented semantics for communicating processes, Springer LNCS 154 (1983), 561–572. (Also, Acta Informatica 23 (1986), 9–66.)

    MATH  MathSciNet  Google Scholar 

  21. I. Phillips, Refusal testing, Proceedings of ICALP'86, Springer LNCS 226 (1986), 304–313.

    MATH  Google Scholar 

  22. G.M. Reed, A uniform mathematical theory for real-time distributed computing, Oxford University D.Phil. thesis 1988; Technical Monograph (Oxford University Computing Laboratory), to appear.

    Google Scholar 

  23. G.M. Reed and A.W. Roscoe, A timed model for communicating sequential processes, Proceedings of ICALP'86, Springer LNCS 226 (1986), 314–323; Theoretical Computer Science 58 (1988) 249–261.

    MATH  MathSciNet  Google Scholar 

  24. G.M. Reed and A.W. Roscoe, Metric spaces as models for real-time concurrency, Proceedings of the Third Workshop on the Mathematical Foundations of Programming Language Semantics (April,1987), LNCS 298 (1988).

    Google Scholar 

  25. A.W. Roscoe, A mathematical theory of communicating processes, Oxford University D.Phil. thesis 1982.

    Google Scholar 

  26. W.C. Rounds, Applications of topology to the semantics of communicating processes, Proceedings of the Pittsburgh Seminar on Concurrency, Springer LNCS 197 (1985).

    Google Scholar 

  27. A.E. Zwarico, A formal model of real-time computing, University of Pennsylvania technical report (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford University Computing Laboratory, 7-11 Keble Road, OX1 3QD, Oxford, U.K.

    G. M. Reed

Authors
  1. G. M. Reed
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reed, G.M. (1990). A hierarchy of domains for real-time distributed computing. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040255

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97375-3

  • Online ISBN: 978-0-387-34808-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation