Skip to main content
SpringerLink
Log in

Factorizing proofs in timed CSP

  • 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

A simple notion of specification is introduced, and a complete set of inference rules given, for reasoning about real-time processes. The notation of Timed Communicating Sequential Processes is employed, and the strongest possible specification of a process is discussed. A proof of correctness of a simple protocol is given to illustrate the method of verification.

supported by ESPRIT project 3096

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.

References

  1. S.R. Blamey, TCSP Processes as Predicates, (to appear) Oxford 1989.

    Google Scholar 

  2. S.D. Brookes, A Model for Communicating Sequential Processes, Oxford University D.Phil thesis 1983.

    Google Scholar 

  3. J.W. Davies, Assisted Proofs for Communicating Sequential Processes, Oxford University M.Sc. thesis 1987.

    Google Scholar 

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

    Google Scholar 

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

  6. K. Paliwoda and J.W. Sanders, The Sliding-Window Protocol in CSP, Oxford University Programming Research Group Technical Monograph 1988, 66.

    Google Scholar 

  7. G.M. Reed, A Uniform Mathematical Theory for Real-time Distributed Computing, Oxford University D.Phil thesis 1988.

    Google Scholar 

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

  9. 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, LNCS 298 1987, 331–343.

    MathSciNet  Google Scholar 

  10. A.W. Roscoe A Mathematical Theory of Communicating Processes Oxford University D.Phil thesis 1982.

    Google Scholar 

  11. S.A. Schneider Communication in Timed Distributed Computing Oxford University M.Sc. thesis 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University Computing Laboratory, 11 Keble Road, OX1 3QD, Oxford

    Jim Davies & Steve Schneider

Authors
  1. Jim Davies
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steve Schneider
    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

Davies, J., Schneider, S. (1990). Factorizing proofs in timed CSP. 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/BFb0040256

Download citation

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

  • 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