Skip to main content
Book cover

Workshop on Logic of Programs

Logic of Programs 1985: Logics of Programs pp 167–189Cite as

Compositional semantics for real-time distributed computing

  • Conference paper
  • First Online:

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

Abstract

We give a compositional denotational semantics for a real-time distributed language, based on the linear history semantics for CSP of Francez et al. Concurrent execution is not modelled by interleaving but by an extension of the maximal parallelism model of Salwicki, that allows the modelling of transmission time for communications. The importance of constructing a semantics (and in general a proof theory) for real-time is stressed by such different sources as the problem of formalizing the real-time aspects of Ada and the elimination of errors in real-time flight control software ([Sunday Times 7-22-84]).

March 1985

supported by the Foundation for Computer Science Research in the Netherlands (SION) with financial aid from the Netherlands Organization for the Advancement of Pure Research (ZWO).

supported by a visitors grant from the Netherlands Organization for the Advancement of Pure Research (ZWO).

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.

References

  1. The programming language Ada. Reference manual. LNCS 155, Springer, 1983.

    Google Scholar 

  2. G. Berry, L. Cosserat. The ESTEREL Synchronous Programming Language and its Mathematical Semantics. R de R No 327, INRIA, Centre Sophia Antipolis, 1984.

    Google Scholar 

  3. A. Bernstein, P.K. Harter jr. Proving Real-time Properties of Programs with Termporal Logic. 8th ACM SOSP, pp. 1–11, 1981.

    Google Scholar 

  4. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe. A theory of Communicating Sequential Processes. JACM 31-3, pp. 560–599, July 1984.

    Google Scholar 

  5. H. Barringer, R. Kuiper, A. Pnueli. Now You May Compose Temporal Logic Specifications. 16th ACM STOC, pp. 51–63, 1984.

    Google Scholar 

  6. P.Branquart, G. Louis, P. Wodon. An Analytical Description of CHILL, the CCITT High Level Language VI, LNCS 128, Springer, 1982.

    Google Scholar 

  7. D. Bjørner, O.N. Oest (eds). Towards a Formal Description of Ada. LNCS 98, Springer, 1980.

    Google Scholar 

  8. A Case Study: The Space Shuttle Software System. CACM 27-9, 1984.

    Google Scholar 

  9. J. Camerini. Semantique Mathematique de Primitives Temps Reel. These de 3 eme cycle, IMA, Université de Nice, 1982.

    Google Scholar 

  10. E.W. Dijkstra. Communication with an automatic computer. Ph.D. thesis, Mathematical Centre, Amsterdam, 1959.

    Google Scholar 

  11. N. Francez, D. Lehmann, A. Pnueli. A linear-history semantics for languages for distributed programming. TCS 32, pp. 25–46, 1984.

    Google Scholar 

  12. R. Gerth. A Maximal Parallelism Semantics for Occam. Notes, 1985.

    Google Scholar 

  13. E.C.R. Hehner, C.A.R. Hoare. A more complete model of communicating processes. TCS 26, pp. 105–120, 1983.

    Google Scholar 

  14. J. Y. Halpern, N. Megiddo, A. A. Munshi. Optimal Precision in the Presence of Uncertainty. IBM Research Lab., San Jose, 1985.

    Google Scholar 

  15. C.A.R. Hoare. Communicating Sequential Processes. CACM 21–8, 1978.

    Google Scholar 

  16. G. Jones. D. Phil.thesis, Oxford, unpublished, 1982.

    Google Scholar 

  17. R. Koymans. Denotational semantics for real-time programming constructs in concurrent languages. Notes, 1984.

    Google Scholar 

  18. R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth, S. Arun-Kumar. Compositional Semantics for Real-time Distributed Computing. KUN Report, Informatics Department, Nijmegen University, 1985.

    Google Scholar 

  19. R. Koymans, J. Vytopil, W.P. de Roever. Real-time Programming and Asynchronous Message Passing. 2nd ACM PODC, pp. 187–197, 1983.

    Google Scholar 

  20. R. Milner. An approach to the semantics of parallel programs. Proc. of the Convegno di Informatica Teorica, Pisa, 1973.

    Google Scholar 

  21. R. Milner. Calculi for Synchrony and Asynchrony. TCS 25, pp. 267–310, 1983.

    Google Scholar 

  22. The Occam language reference manual. Prentice Hall, 1984.

    Google Scholar 

  23. R.K. Shyamasundar. A total correctness proof system for a real-time distributed language. Notes, 1984.

    Google Scholar 

  24. A. Salwicki, T. Müldner. On the algorithmic properties of concurrent programs. LNCS 125, Springer, 1981.

    Google Scholar 

  25. N. Soundararajan. Correctness Proofs for CSP Programs. TCS 23–4, 1983.

    Google Scholar 

  26. N. Soundararajan. Axiomatic Semantics of Communicating Sequential Processes. TOPLAS 6-4, pp. 647–662, 1984.

    Google Scholar 

  27. R.K. Shyamasundar, W. P. de Roever. Semantics of real-time Ada. Notes, 1983.

    Google Scholar 

  28. Sunday Times July 22, 1984.

    Google Scholar 

  29. E. Zijlstra. Real-time semantics. submitted, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rohit Parikh

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koymans, R., Shyamasundar, R.K., de Roever, W.P., Gerth, R., Arun-Kumar, S. (1985). Compositional semantics for real-time distributed computing. In: Parikh, R. (eds) Logics of Programs. Logic of Programs 1985. Lecture Notes in Computer Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15648-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-15648-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39527-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics