Skip to main content

Analysing TM FS : A study of nondeterminism in real-time concurrency

  • Part I: Theoretical Aspects Of Concurrency
  • Conference paper
  • First Online:

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

Abstract

It is well-known that nondeterminism is a consequence of concurrent computation. Modelling it correctly is one of the chief requirements of any theory. In this paper we study how nondeterminism arises in real-time concurrency. The vehicle used is TM FS , the timed failures/stability model for CSP. We see both how this model is able to capture a wide range of subtle behaviours which have no direct untimed analogues, and how the axioms of the model can be justified by a detailed study of nondeterminism.

The authors gratefully acknowledge that the work reported in this paper was supported by the U.S. Office of Naval Research under grant N00014-87-G-0242. Auxiliary support was provided by the ESPRIT BRA SPEC project.

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.

6 References

  1. S.R. Blamey, The soundness and completeness of axioms for CSP processes, Topology, Category Theory and Computer Science, (Oxford University, Press, 1990), G.M. Reed, A.W. Roscoe, R.F. Wachter, editors.

    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, C.A.R. Hoare and A.W. Roscoe, A theory of communicating sequential processes, JACM 31 (1894), 560–599.

    Article  Google Scholar 

  4. 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 

  5. J.W. Davies and S.A. Schneider, Factorising proofs in Timed CSP, Proceedings of the Fifth Workshop on the Mathematical Foundations of Programming Language Semantics (April, 1989), LNCS 442 (1990), 129–159.

    Google Scholar 

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

    Google Scholar 

  7. D.M. Jackson, The sepcification of aircraft engine control software using Timed CSP, Oxford University M.Sc. differtation, 1989.

    Google Scholar 

  8. D.M. Jackson, Specifying Timed Communicating Sequential Processes using temporal logic, Technical Report PRG-90-5, Oxford university Computing Laboratory 1990.

    Google Scholar 

  9. G.M. Reed, A uniform mathematical theory for real-time distributed computing, Oxford University D.Phil thesis 1988.

    Google Scholar 

  10. G.M. Reed, A hierarchy of models for real-time distributed computing, Proceedings of the Fifth Workshop on the Mathematical Foundations of Programming Language Semantics (April, 1989), LNCS 442 (1990), 80–128.

    Google Scholar 

  11. 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, 249–261.

    Google Scholar 

  12. 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), 331–343.

    Google Scholar 

  13. G.M. Reed and A.W. Roscoe, The Timed Failures-Stability Model for CSP, submitted for publication.

    Google Scholar 

  14. A.W. Roscoe, Unbounded nondeterminism in GSP, in ‘Two papers on CSP', Technical monograph PRG-67, Oxford University Computing Laboratory 1988.

    Google Scholar 

  15. S.A. Schneider, Correctness and communication in real-time systems, Oxford University D.Phil. thesis 1990. Published as technical monograph PRG-88.

    Google Scholar 

  16. B. Scattergood, An application of Timed CSP to robot control software, Oxford University MSc dissertation 1990.

    Google Scholar 

  17. R. Stamper, The specification of AGV control software using Timed GSP, Oxford University MSc dissertation 1990.

    Google Scholar 

  18. 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

Authors

Editor information

Akinori Yonezawa Takayasu Ito

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reed, G.M., Roscoe, A.W. (1991). Analysing TM FS : A study of nondeterminism in real-time concurrency. In: Yonezawa, A., Ito, T. (eds) Concurrency: Theory, Language, and Architecture. CONCURRENCY 1989. Lecture Notes in Computer Science, vol 491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53932-8_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-53932-8_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46452-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics