Skip to main content

Semantics of real-time distributed programs

  • Selected Papers
  • Conference paper
  • First Online:

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

Abstract

A semantic model for distributed real-time programs is proposed. The semantics is state-based and compositional. It preserves the basic properties of process autonomy and considers their nondeterministic execution in a dense time domain. The internal actions and communications of a command are treated in a uniform way to obtain a simple semantic domain. An ordering on this domain for information approximation is developed. The absence of global objects in the semantics of a command makes it possible for modular changes to adapt the model for different communication mechanisms and different execution environments. To illustrate this, we show how process executions can be modelled in an environment with limited processors. The proposed semantics models termination, failure, divergence, deadlock, and starvation, and supports an arbitrary degree of parallelism.

This work was supported by research grant GR/D 73881 from the Science and Engineering Research Council.

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. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe, “A Theory of Communicating Sequential Processes”, J. ACM, vol. 31, 1984, pp. 560–599.

    Article  Google Scholar 

  2. A. Goswami and M. Joseph, “A Semantic Model for the Specification of Real-Time Processes”, Res. Rep. 121, Dept of Computer Science, Univ of Warwick, Coventry, 1988.

    Google Scholar 

  3. C.A.R. Hoare, “Communicating Sequential Processes”, Comm. ACM, vol. 21, no. 8, 1978, pp. 666–677.

    Article  Google Scholar 

  4. J. Hooman, “A Compositional Proof Theory for Real-Time Distributed Message Passing”, Tech. Rep., Dept. of Mathematics and Computing Science, Eindhoven Univ of Technology, Eindhoven, 1987.

    Google Scholar 

  5. C. Huizing, R. Gerth, and W.-P. de Roever, “Full Abstraction of a Real-Time Denotational Semantics for an OCCAM-like Language”, in: Proc. 14th ACM Symp. POPL, 1987, pp. 223–238.

    Google Scholar 

  6. R. Koymans, R.K. Shyamasundar, W.-P. de Roever, R. Gerth, and S. Arun-Kumar, “Compositional Semantics for Real-Time Distributed Computing”, in: Lecture Notes in Comp. Sci. 193, Springer-Verlag, Heidelberg, 1985, pp. 167–190.

    Google Scholar 

  7. L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System”, Comm. ACM, vol. 21, no. 7,1978, pp. 558–565.

    Article  Google Scholar 

  8. G.M. Reed and A.W. Roscoe, “A Timed Model for Communicating Sequential Processes”, in: Lecture Notes in Comp. Sci. 226, Springer-Verlag, Heidelberg, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Frederich H. Vogt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goswami, A., Joseph, M. (1988). Semantics of real-time distributed programs. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-50403-6_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50403-0

  • Online ISBN: 978-3-540-45999-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics